On two-way tree automata

DOI10.1016/0020-0190(94)00022-0zbMath0942.68599OpenAlexW1999872993MaRDI QIDQ1327293

Etsuro Moriya

Publication date: 26 February 1996

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00022-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Yield-languages of two-way pushdown tree automata ⋮ Automata for XML -- a survey ⋮ THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES ⋮ Query automata over finite trees

Cites Work

• Unnamed Item
• Tree pushdown automata
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• Pushdown tree automata
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: On two-way tree automata