Factorization Forests

DOI10.1007/978-3-642-02737-6_1zbMath1247.68127OpenAlexW2914203140MaRDI QIDQ3637210

Mikołaj Bojańczyk

Publication date: 7 July 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (5)

Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Separating regular languages with two quantifier alternations ⋮ The factorisation forest theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factorization forests of finite height
• Limitedness theorem on finite automata with distance functions
• Algorithms for determining relative star height and star height
• Polynomial closure and unambiguous product
• Transition graphs and the star-height of regular events
• R-Automata
• The Height of Factorization Forests
• On semigroups of matrices over the tropical semiring
• Distance desert automata and the star height problem
• On finite monoids having only trivial subgroups
• Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
• A Combinatorial Theorem for Trees
• Factorisation Forests for Infinite Words
• The Common Fragment of ACTL and LTL

This page was built for publication: Factorization Forests