On factorization forests of finite height
From MaRDI portal
Publication:1884989
DOI10.1016/S0304-3975(03)00344-XzbMath1071.68038MaRDI QIDQ1884989
Jérémie Chalopin, Hing-Man Leung
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
68R05: Combinatorics in computer science
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
20M15: Mappings of semigroups
Related Items
Factorization forests for infinite words and applications to countable scattered linear orderings, A survey on the local divisor technique, The factorisation forest theorem, 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, The Height of Factorization Forests
Cites Work