Computing the Rabin index of a parity automaton

Abstract : The Rabin index of a rational language of infinite words given by a parity automaton with n states is computable in time O(n(2)c) where c is the cardinality of the alphabet. The number of values used by a parity acceptance condition is always greater than the Rabin index and conversely, the acceptance condition of a parity automaton can always be replaced by an equivalent acceptance condition whose number of used values is exactly the Rabin index. This new acceptance condition can also be computed in time O(n(2)C).
Document type :
Journal articles
Complete list of metadatas

https://hal-upec-upem.archives-ouvertes.fr/hal-00693809
Contributor : Olivier Carton <>
Submitted on : Wednesday, May 2, 2012 - 11:55:28 PM
Last modification on : Wednesday, April 11, 2018 - 12:12:03 PM

Links full text

Identifiers

Collections

Citation

Olivier Carton, R Maceiras. Computing the Rabin index of a parity automaton. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 1999, 33 (6), pp.495--505. ⟨10.1051/ita:1999129⟩. ⟨hal-00693809⟩

Share

Metrics

Record views

221