Computing the rabin index of a regular language of infinite words

DOI10.1006/INCO.1996.0082zbMATH Open0872.68097OpenAlexW1974774490MaRDI QIDQ675222FDOQ675222

Authors: Thomas Wilke, Haiseung Yoo 

Publication date: 13 October 1997

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

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

Recommendations

• Computing the Rabin Index of a Parity Automaton
• Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
• Rabin-Mostowski index problem: a step beyond deterministic automata
• Index problems for game automata
• Chain automata

zbMATH Keywords

deterministic Rabin automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (7)

• Title not available (Why is that?)
• Rabin-Mostowski index problem: a step beyond deterministic automata
• Computing the Rabin Index of a Parity Automaton
• A gap property of deterministic tree languages.
• Computing the Wadge degree, the Lifschitz degree, and the Rabin index of a regular language of infinite words in polynomial time
• Chain automata
• Deciding low levels of tree-automata hierarchy

This page was built for publication: Computing the rabin index of a regular language of infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675222)