The Height of Factorization Forests

DOI10.1007/978-3-540-85238-4_36zbMath1173.68567OpenAlexW1543603062MaRDI QIDQ3599148

Manfred Kufleitner

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_36

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (9)

Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ Unnamed Item ⋮ A survey on the local divisor technique ⋮ Classes of graphs with low complexity: the case of classes with bounded linear rankwidth ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Separating regular languages with two quantifier alternations ⋮ Factorization Forests ⋮ Generic results for concatenation hierarchies ⋮ The factorisation forest theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Factorization forests of finite height
• Polynomial closure and unambiguous product
• On factorization forests of finite height
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• On semigroups of matrices over the tropical semiring
• A Combinatorial Theorem for Trees
• Factorisation Forests for Infinite Words

This page was built for publication: The Height of Factorization Forests