Publisher
Springer International Publishing
Reference16 articles.
1. Ananichev, D.S., Volkov, M.V., Gusev, V.V.: Primitive digraphs with large exponents and slowly synchronizing automata. J. Math. Sci. 192(3), 263–278 (2013).
https://doi.org/10.1007/s10958-013-1392-8
2. Béal, M.P., Czeizler, E., Kari, J., Perrin, D.: Unambiguous automata. Math. Comput. Sci. 1(4), 625–638 (2008).
https://doi.org/10.1007/s11786-007-0027-1
3. Berlinkov, M.V., Szykuła, M.: Algebraic synchronization criterion and computing reset words. Inf. Sci. 369, 718–730 (2016).
https://doi.org/10.1016/j.ins.2016.07.049
4. Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Encyclopedia of Mathematics and its Applications, vol. 129. Cambridge University Press, Cambridge (2010)
5. Biskup, M.T., Plandowski, W.: Shortest synchronizing strings for huffman codes. Theoret. Comput. Sci. 410(38), 3925–3941 (2009).
https://doi.org/10.1016/j.tcs.2009.06.005
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献