Author:
Demaine Erik D.,Eisenstat Sarah,Shallit Jeffrey,Wilson David A.
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci. 47, 149–158 (1986); Erratum 302, 497–498 (2003)
2. Currie, J., Petersen, H., Robson, J.M., Shallit, J.: Separating words with small grammars. J. Automata, Languages, and Combinatorics 4, 101–110 (1999)
3. Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inform. Comput. 205, 1652–1670 (2007)
4. Lecture Notes in Computer Science;R.A. Gimadeev,2010
5. Lecture Notes in Computer Science;P. Goralčík,1986
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Separating Words from Every Start State with Horner Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-03
2. Variations of the Separating Words Problem;Implementation and Application of Automata;2022
3. Separating the Words of a Language by Counting Factors;Fundamenta Informaticae;2021-06-30
4. Separating words and trace reconstruction;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. New Results on Vector and Homing Vector Automata;International Journal of Foundations of Computer Science;2019-12