@article{WilkeYoo:IC:1996,
Abstract = {The Rabin index of a regular language of infinite words is the minimum number of accepting pairs used in any deterministic Rabin automaton recognizing this language. We show that the Rabin index of a language given by a Muller automaton withnstates andmaccepting sets is computable in timeO(m2nc) wherecis the cardinality of the alphabet.},
Author = {Wilke, Thomas and Yoo, Haiseung},
File = {Computing the Rabin Index of a Regular Language of Infinite Words - 1-s2.0-S0890540196900826-main - a - w.pdf},
ISSN = {0890-5401},
Journal = {Information and Computation},
Number = {1},
Pages = {61--70},
Title = {Computing the Rabin Index of a Regular Language of Infinite Words},
URL = {http://www.sciencedirect.com/science/article/pii/S0890540196900826},
Volume = {130},
Year = {1996},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0890540196900826},
bdsk-url-2 = {https://doi.org/10.1006/inco.1996.0082},
date-added = {2020-08-11 13:12:49 +0200},
date-modified = {2020-08-11 13:13:00 +0200},
doi = {10.1006/inco.1996.0082}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A