Infinity problems and countability problems for \(\omega \)-automata

DOI10.1016/j.ipl.2006.06.011zbMath1185.68400OpenAlexW2077572182MaRDI QIDQ845856

Yunfeng Tao

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.011

zbMATH Keywords

complexityformal languagescardinality\(\omega \)-automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

First-order and counting theories ofω-automatic structures

Cites Work

• Space-bounded reducibility among combinatorial problems
• ω-Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item