THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES

DOI10.1142/S0129054102000959zbMath1066.68061MaRDI QIDQ3021939

Anne Brüggemann-Klein, Derick Wood

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

tree automatanondeterministiccaterpillarstwo-waytree regularity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (1)

Automata for XML -- a survey

Cites Work

• On two-way tree automata
• Yield-languages of two-way pushdown tree automata
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Generalizations of regular sets and their application to a study of context-free languages
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES