Rabin tree automata and finite monoids

DOI10.1016/0304-3975(94)90275-5zbMath0823.68064OpenAlexW2061287496MaRDI QIDQ1341736

Danièle Beauquier, Andreas Podelski

Publication date: 9 January 1995

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

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

zbMATH Keywords

finite monoids\(\omega\)-tree languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On reverse and general definite tree languages
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Rabin tree automata and finite monoids