Publisher
Springer International Publishing
Reference18 articles.
1. Babai, L.: On the diameter of eulerian orientations of graphs. In: SODA 2006: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete algorithms, pp. 822–831. ACM, New York (2006)
2. Cohn, M.: Properties of linear machines. J. ACM 11(3), 296–301 (1964),
http://doi.acm.org/10.1145/321229.321233
3. Gazdag, Z., Iván, S., Nagy-György, J.: Improved upper bounds on synchronizing nondeterministic automata. Information Processing Letters 109(17), 986–990 (2009),
http://www.sciencedirect.com/science/article/pii/S0020019009001811
4. Gill, A.: State-identification experiments in finite automata. Inform. Control 4(2-3), 132–154 (1961),
http://www.sciencedirect.com/science/article/pii/S001999586180003X
5. Güniçen, C., İnan, K., Türker, U.C., Yenigün, H.: The relation between preset distinguishing sequences and synchronizing sequences. Formal Aspects of Computing, 1–15 (2014),
http://dx.doi.org/10.1007/s00165-014-0297-8
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Interplay Between Černý and Babai’s Conjectures;International Journal of Foundations of Computer Science;2019-01
2. On the Interplay Between Babai and Černý’s Conjectures;Developments in Language Theory;2017