Similar Items: A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra
- Ambiguity Hierarchy of Regular Infinite Tree Languages
- Regular Tree Algebras
- Regular matching problems for infinite trees
- Logic Meets Algebra: the Case of Regular Languages
- Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
- Degrees of Lookahead in Regular Infinite Games