Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Bach, E., Shallit, J.: Algorithmic Number Theory. MIT Press, Cambridge (1996)
2. Lecture Notes in Computer Science;H. Björklund,2008
3. Chrobak, M.: Finite automata and unary languages. Theoretical Computer Science 47, 149–158 (1986); Errata: vol. 302(1-3), pp. 497–498 (2003)
4. Geffert, V., Mereghetti, C., Pighizzini, G.: Complementing two-way finite automata. Information and Computation 205(8), 1173–1187 (2007)
5. Holzer, M., Kutrib, M.: Nondeterministic descriptional complexity of regular languages. Intl. J. of Foundations of Computer Science 14, 1087–1102 (2003)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献