Aperiodicity in Tree Automata
From MaRDI portal
Publication:3522867
DOI10.1007/978-3-540-75414-5_12zbMath1148.68399MaRDI QIDQ3522867
Publication date: 4 September 2008
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75414-5_12
68Q45: Formal languages and automata
Related Items
Cites Work
- On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics
- Finite-automaton aperiodicity is PSPACE-complete
- General varieties of tree languages
- Modulo-counting quantifiers over finite trees
- Characterizing CTL-like logics on finite trees.
- First-order properties of trees, star-free expressions, and aperiodicity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item