Publisher
Springer International Publishing
Reference6 articles.
1. Berman, P., Lingas, A.: On complexity of regular languages in terms of finite automata. Technical report 304, Institute of Computer Science, Polish Academy of Sciences (1977)
2. Lecture Notes in Computer Science;MP Bianchi,2015
3. Lecture Notes in Computer Science;J Hromkovič,2012
4. Lecture Notes in Computer Science;J Hromkovič,2003
5. Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing. ACM (1978)