The NP-completeness of the Road Coloring Problem

Authors:
Adam Roman
Affiliations:
Institute of Computer Science, Jagiellonian University, Cracow, Poland
Venue:
Information Processing Letters
Year:
2011

Citing 3
Cited 2

Reset sequences for monotonic automata

SIAM Journal on Computing
Decision version of the road coloring problem is NP-complete

FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
The complexity of finding reset words in finite automata

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science

P---NP threshold for synchronizing road coloring

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Approximating the Minimum Length of Synchronizing Words Is Hard

Theory of Computing Systems

Quantified Score

Hi-index	0.90

Visualization

Abstract