Factorization forests of finite height
From MaRDI portal
Publication:908712
DOI10.1016/0304-3975(90)90047-LzbMath0693.68044MaRDI QIDQ908712
Publication date: 1990
Published in: Theoretical Computer Science (Search for Journal in Brave)
Factorials, binomial coefficients, combinatorial functions (05A10) Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99)
Related Items
The limitedness problem on distance automata: Hashiguchi's method revisited, On factorization forests of finite height, Thin and Thick Timed Regular Languages, The word problem for omega-terms over the Trotter-Weil hierarchy, Factorization forests for infinite words and applications to countable scattered linear orderings, Polynomial closure and unambiguous product, Polynomial closure and unambiguous product, Unnamed Item, A Note on Decidable Separability by Piecewise Testable Languages, Testing membership for timed automata, Pebble minimization: the last theorems, A survey on the local divisor technique, Locally countable pseudovarieties, A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata, A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS, R-Automata, Classes of graphs with low complexity: the case of classes with bounded linear rankwidth, The product of rational languages, Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups, On semigroups of matrices over the tropical semiring, One-way resynchronizability of word transducers, On a question about factorization forests, ω♯-Algebras, AROUND DOT-DEPTH ONE, Universality of R-automata with Value Copying, The Height of Factorization Forests, Structure and generation of crossing-critical graphs, Unnamed Item, Unnamed Item, Unnamed Item, Separating regular languages with two quantifier alternations, Factorization Forests, The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets, Logic, semigroups and automata on words, Generic results for concatenation hierarchies, What's decidable about weighted automata?, Regular transducer expressions for regular transformations, Unnamed Item, The factorisation forest theorem, New upper bounds to the limitedness of distance automata, From Two-Way Transducers to Regular Function Expressions, Entropy of regular timed languages, Some properties of recognizable \(\mathcal Z\)-subsets
Cites Work
- Two combinatorial properties of partitions of the free semigroup into finitely many parts
- Limitedness theorem on finite automata with distance functions
- On a natural extension of Jacob's ranks
- Un théorème de factorisation des produits d'endomorphismes de \(K^N\)
- An interesting combinatorial method in the theory of locally finite semigroups
- Generalisation du theoreme de van der Waerden sur les semi-groupes repetitifs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
