Publisher
Springer Nature Switzerland
Reference12 articles.
1. Comon, H., et al.: Tree automata techniques and applications (Nov 2008). https://jacquema.gitlabpages.inria.fr/files/tata.pdf
2. Martyugin, P.: A lower bound for the length of the shortest carefully synchronizing words. Russian Math. 54, 46–54 (2010). https://doi.org/10.3103/S1066369X10010056
3. Lecture Notes in Computer Science;PV Martyugin,2013
4. Pin, J.E.: On two combinatorial problems arising from automata theory. In: Combinatorial Mathematics, North-Holland Mathematics Studies, vol. 75, pp. 535–548. North-Holland (1983). https://doi.org/10.1016/S0304-0208(08)73432-7
5. Pin, J. (ed.): Handbook of Automata Theory. European Mathematical Society Publishing House, Zürich, Switzerland (2021). https://doi.org/10.4171/Automata
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献