Factorization forests of finite height
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3873610 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 3552814 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- An interesting combinatorial method in the theory of locally finite semigroups
- Generalisation du theoreme de van der Waerden sur les semi-groupes repetitifs
- Limitedness theorem on finite automata with distance functions
- On a natural extension of Jacob's ranks
- Two combinatorial properties of partitions of the free semigroup into finitely many parts
- Un théorème de factorisation des produits d'endomorphismes de \(K^N\)
Cited in
(47)- Structure and generation of crossing-critical graphs
- The word problem for omega-terms over the Trotter-Weil hierarchy
- \(\omega\sharp\)-algebras
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- scientific article; zbMATH DE number 7215283 (Why is no real title available?)
- Polynomial closure and unambiguous product
- Thin and thick timed regular languages
- One-way resynchronizability of word transducers
- Entropy of regular timed languages
- Around dot-depth one
- Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- Separating regular languages with two quantifier alternations
- Some properties of recognizable \(\mathcal Z\)-subsets
- From two-way transducers to regular function expressions
- Pebble minimization: the last theorems
- The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets
- Universality of R-automata with Value Copying
- New upper bounds to the limitedness of distance automata
- Definable decompositions for graphs of bounded linear cliquewidth
- Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
- String-to-string interpretations with polynomial-size output
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals
- On a question about factorization forests
- On factorization forests of finite height
- R-Automata
- A Note on Decidable Separability by Piecewise Testable Languages
- A survey on the local divisor technique
- The product of rational languages
- Generic results for concatenation hierarchies
- Logic, semigroups and automata on words
- scientific article; zbMATH DE number 7003194 (Why is no real title available?)
- The factorisation forest theorem
- Polynomial closure and unambiguous product
- Testing membership for timed automata
- Factorization Forests
- What's decidable about weighted automata?
- The limitedness problem on distance automata: Hashiguchi's method revisited
- Locally countable pseudovarieties
- The Height of Factorization Forests
- scientific article; zbMATH DE number 475428 (Why is no real title available?)
- scientific article; zbMATH DE number 7561484 (Why is no real title available?)
- Factorization forests for infinite words and applications to countable scattered linear orderings
- Stable graphs of bounded twin-width
- Computing the bandwidth of meager timed automata
- On semigroups of matrices over the tropical semiring
This page was built for publication: Factorization forests of finite height
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908712)
