The Height of Factorization Forests

DOI10.1007/978-3-540-85238-4_36MaRDI QIDQ3599148zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On factorization forests of finite height
• Factorization forests of finite height
• scientific article; zbMATH DE number 475428
• IDENTITIES AND A BOUNDED HEIGHT CONDITION FOR SEMIGROUPS
• Factorization forests for infinite words and applications to countable scattered linear orderings

Cites work

• A Combinatorial Theorem for Trees
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• Factorisation Forests for Infinite Words
• Factorization forests of finite height
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• scientific article; zbMATH DE number 475428 (Why is no real title available?)
• On factorization forests of finite height
• On semigroups of matrices over the tropical semiring
• Polynomial closure and unambiguous product

Cited in

(16)

• Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
• On factorization forests of finite height
• The factorisation forest theorem
• Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
• Generic results for concatenation hierarchies
• Factorization Forests
• scientific article; zbMATH DE number 475428 (Why is no real title available?)
• Separating regular languages with two quantifier alternations
• High-dimensional Canonical Forest
• Definable decompositions for graphs of bounded linear cliquewidth
• The big-O problem for max-plus automata is decidable (PSPACE-complete)
• Polynomial kernel for immersion hitting in tournaments
• A purely algebraic proof of the omega-reducibility of pseudovarieties representing low half levels of concatenation hierarchies
• Factorization forests for infinite words and applications to countable scattered linear orderings
• A survey on the local divisor technique
• Factorization forests of finite height

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599148)