Single-Path Restarting Tree Automata

DOI10.1007/978-3-642-03564-7_22zbMath1256.68110OpenAlexW1669410935MaRDI QIDQ3642542

Heiko Stamer, Friedrich Otto

Publication date: 5 November 2009

Published in: Algebraic Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03564-7_22

zbMATH Keywords

classes of tree languageslinear context-free tree languagerestarting tree automatonsingle-path top-down tree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Multiple context-free tree grammars: lexicalization and characterization

This page was built for publication: Single-Path Restarting Tree Automata