Loops and Overloops for Tree Walking Automata
From MaRDI portal
Publication:5200062
DOI10.1007/978-3-642-22256-6_16zbMath1297.68134MaRDI QIDQ5200062
Pierre-Cyrille Héam, Vincent Hugot, Olga Kouchnarenko
Publication date: 29 July 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22256-6_16
68Q45: Formal languages and automata
Related Items
Cites Work
- Tree-walking automata cannot be determinized
- Tree-Walking Automata
- Transitive closure logic, nested tree walking automata, and XPath
- Tree-walking automata do not recognize all regular languages
- Random Generation of Deterministic Tree (Walking) Automata
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Semantics of context-free languages: Correction
- Translations on a context free grammar