Computing the rabin index of a regular language of infinite words
From MaRDI portal
Publication:675222
DOI10.1006/inco.1996.0082zbMath0872.68097MaRDI QIDQ675222
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
68Q45: Formal languages and automata
Related Items
Deciding low levels of tree-automata hierarchy, Computing the Rabin Index of a Parity Automaton, A gap property of deterministic tree languages.