Tree-Walking Automata
From MaRDI portal
Publication:3540091
DOI10.1007/978-3-540-88282-4_1zbMath1156.68445OpenAlexW154248286MaRDI QIDQ3540091
Publication date: 20 November 2008
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_1
Related Items
Deciding twig-definability of node selecting tree automata ⋮ Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs ⋮ Parameter reduction and automata evaluation for grammar-compressed trees ⋮ Loops and overloops for tree-walking automata ⋮ Verification of component-based systems with recursive architectures ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ Adding pebbles to weighted automata: easy specification \& efficient evaluation ⋮ Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey ⋮ Unnamed Item ⋮ The uniform measure of simple regular sets of infinite trees ⋮ Loops and Overloops for Tree Walking Automata ⋮ On Models of a Nondeterministic Computation ⋮ Automata on finite trees ⋮ Plane-Walking Automata ⋮ On labeled birooted tree languages: algebras, automata and logic
