Loops and overloops for tree-walking automata

DOI10.1016/j.tcs.2012.04.026zbMath1247.68142OpenAlexW3005224781MaRDI QIDQ442148

Vincent Hugot, Pierre-Cyrille Héam, Olga Kouchnarenko

Publication date: 9 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.026

zbMATH Keywords

approximationloopsmembershipemptinessoverloopstree-walking automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Uses Software

• REGAL

Cites Work

• Unnamed Item
• Tree-walking automata cannot be determinized
• REGAL: A Library to Randomly and Exhaustively Generate Automata
• 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
• Loops and Overloops for Tree Walking Automata
• Semantics of context-free languages
• Translations on a context free grammar

This page was built for publication: Loops and overloops for tree-walking automata