The congruence theory of closure properties of regular tree languages

DOI10.1016/0304-3975(90)90020-IzbMath0704.68070MaRDI QIDQ917323

Seppo Tirri

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

regular tree languagesregular grammarsfinite tree automatafinite recognizersrecognizable forests

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Algebra automata I: Parallel programming as a prolegomena to the categorical approach
• The minimalization of tree automata

This page was built for publication: The congruence theory of closure properties of regular tree languages