Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference21 articles.
1. Adler, R., Goodwyn, L., Weiss, B.: Equivalence of topological Markov shifts. Isr. J. Math. 27, 49–63 (1977)
2. Berlinkov, M.: Approximating the minimum length of synchronizing words is hard. Lect. Notes Comput. Sci. 6072, 37–47 (2010)
3. Berlinkov, M.: On the error of polynomial time computation for the optimal coloring of a graph into a synchronizing automaton. Discrete Appl. Math. 2011(2), 49–72 (2011) (in Russian)
4. Černý, J.: Poznámka k homogénnym eksperimentom s konečnými automatami. Mat.-Fyz. Cas. Slov. Akad. Vied 14(3), 208–216 (1964) (in Slovak)
5. Eppstein, D.: Reset sequences for monotonic automata. SIAM J. Comput. 19, 500–510 (1990)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献