Tree-walking automata do not recognize all regular languages
From MaRDI portal
Publication:3581424
DOI10.1145/1060590.1060626zbMath1192.68406OpenAlexW2112156179MaRDI QIDQ3581424
Thomas Colcombet, Mikołaj Bojańczyk
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060626
Related Items (7)
Complementing deterministic tree-walking automata ⋮ Automata for XML -- a survey ⋮ Deterministic Caterpillar Expressions ⋮ Loops and overloops for tree-walking automata ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Streaming tree automata ⋮ Loops and Overloops for Tree Walking Automata
This page was built for publication: Tree-walking automata do not recognize all regular languages
