Author:
Berlinkov Mikhail,Szykuła Marek
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Lecture Notes in Computer Science;D Ananichev,2010
2. Béal, M.P., Berlinkov, M.V., Perrin, D.: A quadratic upper bound on the size of a synchronizing word in one-cluster automata. Int. J. Found. Comput. Sci. 22(2), 277–288 (2011)
3. Lecture Notes in Computer Science;M-P Béal,2009
4. Berlinkov, M.V.: On the probability to be synchronizable (2013).
http://arxiv.org/abs/1304.5774
5. Berlinkov, M.V.: Synchronizing quasi-eulerian and quasi-one-cluster automata. Int. J. Found. Comput. Sci. 24(6), 729–745 (2013)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献