Factorization Forests

DOI10.1007/978-3-642-02737-6_1MaRDI QIDQ3637210zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The Height of Factorization Forests
• On a question about factorization forests
• Factorization forests of finite height
• scientific article; zbMATH DE number 1222135
• Random forests
• Random recursive forests
• Components of Random Forests
• Ordinal forests

Cites work

• scientific article; zbMATH DE number 3495598 (Why is no real title available?)
• scientific article; zbMATH DE number 1163639 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A Combinatorial Theorem for Trees
• Algorithms for determining relative star height and star height
• Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata
• Distance desert automata and the star height problem
• Factorisation Forests for Infinite Words
• Factorization forests of finite height
• Limitedness theorem on finite automata with distance functions
• On finite monoids having only trivial subgroups
• On semigroups of matrices over the tropical semiring
• Polynomial closure and unambiguous product
• R-Automata
• The Common Fragment of ACTL and LTL
• The Height of Factorization Forests
• Transition graphs and the star-height of regular events

Cited in

(11)

• Bandwidth of timed automata: 3 classes
• scientific article; zbMATH DE number 7566055 (Why is no real title available?)
• Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups
• Polynomial kernel for immersion hitting in tournaments
• The factorisation forest theorem
• High-dimensional Canonical Forest
• Separating regular languages with two quantifier alternations
• scientific article; zbMATH DE number 7215283 (Why is no real title available?)
• Forest Learning From Data and its Universal Coding
• Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
• The regular languages of first-order logic with one alternation

This page was built for publication: Factorization Forests

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