The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Computing the Rabin Index of a Parity Automaton

Olivier Carton;  Ramón Maceiras — 2010

RAIRO - Theoretical Informatics and Applications

The Rabin index of a rational language of infinite words given by a parity automaton with states is computable in time ( ) where 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...

Page 1

Download Results (CSV)