User menu

Reset Thresholds of Automata with Two Cycle Lengths

Bibliographic reference Gusev, Vladimir ; Pribavkina, Elena V.. Reset Thresholds of Automata with Two Cycle Lengths. In: International Journal of Foundations of Computer Science, Vol. 26, no.07, p. 953-966 (2015)
Permanent URL
  1. Ananichev D.S., Volkov M.V., Zaks Yu.I., Synchronizing automata with a letter of deficiency 2, 10.1016/j.tcs.2007.01.010
  2. Černý J., Cas. Slovensk. Akad. Vied., 14, 208 (1964)
  3. Dulmage A. L., Illinois J. Math., 8, 642 (1964)
  4. Kisielewicz Andrzej, Szykuła Marek, Generating Small Automata and the Černý Conjecture, Implementation and Application of Automata (2013) ISBN:9783642392733 p.340-348, 10.1007/978-3-642-39274-0_30
  5. Lewin M., Illinois J. Math., 25, 87 (1981)
  6. Pin J.-E, Ann. Discrete Math., 17, 535 (1983)
  7. Sandberg Sven, 1 Homing and Synchronizing Sequences, Model-Based Testing of Reactive Systems (2005) ISBN:9783540262787 p.5-33, 10.1007/11498490_2
  8. Trahtman A.N., Notable trends concerning the synchronization of graphs and automata, 10.1016/j.endm.2006.06.072
  9. Trahtman A. N., The road coloring problem, 10.1007/s11856-009-0062-5
  10. Volkov Mikhail V., Synchronizing Automata and the Černý Conjecture, Language and Automata Theory and Applications ISBN:9783540882817 p.11-27, 10.1007/978-3-540-88282-4_4