Computing the rabin index of a regular language of infinite words

DOI10.1006/inco.1996.0082zbMath0872.68097OpenAlexW1974774490MaRDI QIDQ675222

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

zbMATH Keywords

deterministic Rabin automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

A gap property of deterministic tree languages. ⋮ Deciding low levels of tree-automata hierarchy ⋮ Computing the Rabin Index of a Parity Automaton

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