On the power of tree-walking automata.

DOI10.1016/S0890-5401(03)00013-0zbMath1054.68086OpenAlexW1971898721MaRDI QIDQ1401944

Frank Neven, Thomas Schwentick

Publication date: 19 August 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00013-0

zbMATH Keywords

LogicFormal languages.Regular tree languagesTree-walking automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Deciding determinism of caterpillar expressions ⋮ Automata for XML -- a survey ⋮ Deterministic Caterpillar Expressions ⋮ Regular languages with variables on graphs ⋮ Pebble Weighted Automata and Weighted Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domains of partial attributed tree transducers
• A comparison of tree transductions defined by monadic second order logic and by attribute grammars
• A formal model for an expressive fragment of XSLT
• Parallel and two-way automata on directed ordered acyclic graphs
• Translations on a context free grammar

This page was built for publication: On the power of tree-walking automata.