Algebra for trees
From MaRDI portal
Publication:2074223
DOI10.4171/Automata-1/22OpenAlexW3191300823MaRDI QIDQ2074223
Publication date: 4 February 2022
Full work available at URL: https://doi.org/10.4171/automata-1/22
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regular languages of thin trees
- Recognisability for algebras of infinite trees
- An algebraic characterization of frontier testable tree languages
- Tree-walking automata cannot be determinized
- Modulo-counting quantifiers over finite trees
- An algebraic proof of Rabin's tree theorem
- Algebraic recognizability of regular tree languages
- Characterizing CTL-like logics on finite trees.
- Characterizing EF and EX tree logics
- Wreath Products of Forest Algebras, with Applications to Tree Logics
- Regular tree languages definable in FO and in FO mod
- Piecewise testable tree languages
- Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets
- Algebra for Infinite Forests with an Application to the Temporal Logic EF
- A decidable characterization of locally testable tree languages
- Two-Way Unary Temporal Logic over Trees
- Recognisable Languages over Monads
- Characterization of Logics over Ranked Tree Languages
- First-order properties of trees, star-free expressions, and aperiodicity
- The structure of finite algebras
- Deciding Piecewise Testable Separability for Regular Tree Languages
- It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton
- Some results onC-varieties
- Wreath Products of Distributive Forest Algebras
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Tree Languages Defined in First-Order Logic with One Quantifier Alternation
This page was built for publication: Algebra for trees
