Pushdown tree automata, algebraic tree systems, and algebraic tree series

DOI10.1006/INCO.2000.2908zbMath1003.68060OpenAlexW2094347340MaRDI QIDQ1854412

Werner Kuich

Publication date: 14 January 2003

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

Full work available at URL: https://doi.org/10.1006/inco.2000.2908

zbMATH Keywords

algebraic tree systemsformal tree seriespushdown tree automata

Mathematics Subject Classification ID

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

Related Items (1)

Algebraic Systems and Pushdown Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic semantics
• Recognizable formal power series on trees
• IO and OI. I
• Completeness of Park induction
• Context-free series on trees
• Pushdown tree automata
• Deciding equivalence of finite tree automata
• Context-free grammars on trees
• Indexed Grammars—An Extension of Context-Free Grammars
• Nested Stack Automata

This page was built for publication: Pushdown tree automata, algebraic tree systems, and algebraic tree series