Computing the Rabin index of a parity automaton - Archive ouverte HAL Access content directly
Journal Articles RAIRO - Theoretical Informatics and Applications (RAIRO: ITA) Year : 1999

Computing the Rabin index of a parity automaton

R Maceiras
  • Function : Author

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).

Dates and versions

hal-00693809 , version 1 (02-05-2012)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More