The factorisation forest theorem
From MaRDI portal
Publication:2074219
DOI10.4171/Automata-1/18OpenAlexW4205894980MaRDI QIDQ2074219
Publication date: 4 February 2022
Full work available at URL: https://doi.org/10.4171/automata-1/18
Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- Factorization forests for infinite words and applications to countable scattered linear orderings
- Factorization forests of finite height
- Limitedness theorem on finite automata with distance functions
- The monadic theory of order
- Polynomial closure and unambiguous product
- The limitedness problem on distance automata: Hashiguchi's method revisited
- On factorization forests of finite height
- Linear time solvable optimization problems on graphs of bounded clique-width
- Complementation of rational sets on scattered linear orderings of finite rank
- An interesting combinatorial method in the theory of locally finite semigroups
- Regular Cost Functions, Part I: Logic and Algebra over Words
- An extension of data automata that captures XPath
- Size-Change Abstraction and Max-Plus Automata
- Enumeration of monadic second-order queries on trees
- Regular Languages of Words over Countable Linear Orderings
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
- The Height of Factorization Forests
- Factorization Forests
- Equations Defining the Polynomial Closure of a Lattice of Regular Languages
- On semigroups of matrices over the tropical semiring
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Magnitude Monadic Logic over Words and the Use of Relative Internal Set Theory
- XPath evaluation in linear time
- A Combinatorial Theorem for Trees
- Factorisation Forests for Infinite Words
This page was built for publication: The factorisation forest theorem
