Title :
Synchronizing automata: Reset strings and state complexity
Author :
Kelemenova, Alica
Author_Institution :
Inst. of Comput. Sci., Silesian Univ., Opava, Czech Republic
Abstract :
Dual problem is formulated to the problem of the shortest reset word of synchronizing automata. Some preliminary results are presented.
Keywords :
computational complexity; finite automata; synchronisation; finite automata deterministic synchronization; reset strings; shortest reset word; state complexity;
Conference_Titel :
Computational Intelligence and Informatics (CINTI), 2012 IEEE 13th International Symposium on
Conference_Location :
Budapest
Print_ISBN :
978-1-4673-5205-5
Electronic_ISBN :
978-1-4673-5210-9
DOI :
10.1109/CINTI.2012.6496796
