References

  1. Laurent Doyen, Line Juhl, Kim G. Larsen, Nicolas Markey & Mahsa Shirmohammadi (2013): Synchronizing Words for Timed and Weighted Automata. Research Report LSV-13-15. Laboratoire Spécification et Vérification, ENS Cachan, France. Available at http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/PDF/ rr-lsv-2013-15.pdf. 26 pages.
  2. Laurent Doyen, Thierry Massart & Mahsa Shirmohammadi (2011): Infinite Synchronizing Words for Probabilistic Automata. In: Filip Murlak & Piotr Sankowski: Mathematical Foundations of Computer Science 2011, Lecture Notes in Computer Science 6907. Springer Berlin Heidelberg, pp. 278–289, doi:10.1007/978-3-642-22993-0_27.
  3. Stephane Gaubert & Ricardo Katz (2006): Reachability Problems for Products of Matrices in Semirings.. IJAC 16(3), pp. 603–627. Available at http://dblp.uni-trier.de/db/journals/ijac/ijac16.html#GaubertK06.
  4. Zsolt Gazdag, Szabolcs Iván & Judit Nagy-György (2009): Improved Upper Bounds on Synchronizing Nondeterministic Automata. Inf. Process. Lett. 109(17), pp. 986–990, doi:10.1016/j.ipl.2009.05.007.
  5. Vesa Halava (1997): Decidable and Undecidable Problems in Matrix Theory.
  6. Vesa Halava & Tero Harju (2001): Mortality in Matrix Semigroups. AMER. MATH. MONTHLY 2001, pp. 653.
  7. Vesa Halava & Mika Hirvensalo (2007): Improved matrix pair undecidability results. Acta Informatica 44(3-4), pp. 191–205, doi:10.1007/s00236-007-0047-y.
  8. Vesa Halava, Mika Hirvensalo & Ronald de Wolf (2001): Marked {PCP} is decidable. Theoretical Computer Science 255(1–2), pp. 193 – 204, doi:10.1016/S0304-3975(99)00163-2.
  9. Balázs Imreh & Magnus Steinby (1999): Directable Nondeterministic Automata.. Acta Cybern. 14(1), pp. 105–115. Available at http://dblp.uni-trier.de/db/journals/actaC/actaC14.html#ImrehS99.
  10. D.J. Kfoury (1970): Synchronizing Sequences for Probabilistic Automata. Stud. Appl. Math. 49, pp. 101–103.
  11. P. V. Martyugin (2010): A lower bound for the length of the shortest carefully synchronizing words. Russian Mathematics 54, pp. 46–54, doi:10.3103/S1066369X10010056.
  12. P.V. Martyugin (2010): Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA. In: Farid Ablayev & ErnstW. Mayr: Computer Science – Theory and Applications, Lecture Notes in Computer Science 6072. Springer Berlin Heidelberg, pp. 288–302, doi:10.1007/978-3-642-13182-0_27.
  13. Christos H. Papadimitriou (1994): Computational complexity.. Addison-Wesley.
  14. M. Paterson (1970): Unsolvability in 33 matrices. Studies in Applied Mathematics 49, pp. 105–107.
  15. Igor Potapov (2004): From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata. In: Developments in Language Theory, LNCS 3340, pp. 345–356, doi:10.1007/978-3-540-30550-7_29.
  16. Mikhail V. Volkov (2008): Language and Automata Theory and Applications, chapter Synchronizing Automata and the Černý Conjecture. Springer-Verlag, Berlin, Heidelberg, pp. 11–27, doi:10.1007/978-3-540-88282-4_4.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org