Pages that link to "Item:Q908712"

The following pages link to Factorization forests of finite height (Q908712):

Displaying 47 items.

• On a question about factorization forests (Q673794) (← links)
• Factorization forests for infinite words and applications to countable scattered linear orderings (Q846364) (← links)
• A survey on the local divisor technique (Q896673) (← links)
• Polynomial closure and unambiguous product (Q1361889) (← links)
• New upper bounds to the limitedness of distance automata (Q1575957) (← links)
• The word problem for omega-terms over the Trotter-Weil hierarchy (Q1635816) (← links)
• Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups (Q1731800) (← links)
• Logic, semigroups and automata on words (Q1817074) (← links)
• Some properties of recognizable \(\mathcal Z\)-subsets (Q1870588) (← links)
• The limitedness problem on distance automata: Hashiguchi's method revisited (Q1884970) (← links)
• On factorization forests of finite height (Q1884989) (← links)
• What's decidable about weighted automata? (Q2064522) (← links)
• Regular transducer expressions for regular transformations (Q2064527) (← links)
• The factorisation forest theorem (Q2074219) (← links)
• Classes of graphs with low complexity: the case of classes with bounded linear rankwidth (Q2225428) (← links)
• One-way resynchronizability of word transducers (Q2233399) (← links)
• Generic results for concatenation hierarchies (Q2311891) (← links)
• Entropy of regular timed languages (Q2343131) (← links)
• Locally countable pseudovarieties (Q2687295) (← links)
• A Note on Decidable Separability by Piecewise Testable Languages (Q2947878) (← links)
• Thin and Thick Timed Regular Languages (Q3172847) (← links)
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417) (← links)
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
• R-Automata (Q3541011) (← links)
• The Height of Factorization Forests (Q3599148) (← links)
• Factorization Forests (Q3637210) (← links)
• On semigroups of matrices over the tropical semiring (Q4365014) (← links)
• Separating regular languages with two quantifier alternations (Q4558789) (← links)
• (Q4611380) (← links)
• The product of rational languages (Q4630281) (← links)
• Polynomial closure and unambiguous product (Q4645191) (← links)
• The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets (Q4717041) (← links)
• AROUND DOT-DEPTH ONE (Q4923283) (← links)
• (Q5091140) (← links)
• (Q5091268) (← links)
• (Q5114822) (← links)
• Structure and generation of crossing-critical graphs (Q5115801) (← links)
• <i>ω♯</i>-Algebras (Q5159802) (← links)
• Universality of R-automata with Value Copying (Q5179055) (← links)
• (Q5856407) (← links)
• From Two-Way Transducers to Regular Function Expressions (Q5859650) (← links)
• Testing membership for timed automata (Q6090987) (← links)
• Pebble minimization: the last theorems (Q6091210) (← links)
• Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations (Q6602314) (← links)
• The boundedness and zero isolation problems for weighted automata over nonnegative rationals (Q6649444) (← links)
• Stable graphs of bounded twin-width (Q6649471) (← links)
• Computing the bandwidth of meager timed automata (Q6666783) (← links)