Restarting Tree Automata and Linear Context-Free Tree Languages

DOI10.1007/978-3-540-75414-5_18zbMath1148.68403OpenAlexW1546833475MaRDI QIDQ3522874

Friedrich Otto, Heiko Stamer

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-75414-5_18

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

The generative power of delegation networks ⋮ Multiple context-free tree grammars: lexicalization and characterization

Cites Work

• Unnamed Item
• Linearity and nondeletion on monadic context-free tree grammars
• Tree pushdown automata
• Un théorème de duplication pour les forets algébriques
• A generalized approach to formal languages
• Pumping lemmas for term languages
• Spinal-formed context-free tree grammars
• Closure properties of linear context-free tree languages with an application to optimality theory
• Pushdown tree automata
• The equivalence of four extensions of context-free grammars
• Restarting Tree Automata
• Indexed Grammars—An Extension of Context-Free Grammars

This page was built for publication: Restarting Tree Automata and Linear Context-Free Tree Languages