Topological characterizations of infinite tree languages

DOI10.1016/0304-3975(87)90085-5zbMath0627.68067OpenAlexW1998597554MaRDI QIDQ1092675

Tetsuo Moriya

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90085-5

zbMATH Keywords

tree languagesacceptance of finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

The Borel hierarchy is infinite in the class of regular sets of trees

Cites Work

• A note on \(\omega\)-regular languages
• Adherences of languages
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decision problems forω-automata
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item

This page was built for publication: Topological characterizations of infinite tree languages