Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. A two-way automaton with fewer states than any equivalent one-way automaton;Barnes;IEEE Trans. on Comp.,1974
2. On the complexity of regular languages in terms of finite automata;Berman,1977
3. On a problem of partitions;Brauer;Amer. J. Math.,1942
4. On a problem of Frobenius;Brauer;J. Reine Angew. Math.,1962
5. Alternation;Chandra;J. Assoc. Comput. Mach.,1981
Cited by
213 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Complexity of Unary Exclusive Nondeterministic Finite Automata;Electronic Proceedings in Theoretical Computer Science;2024-09-11
2. Conversions Between Six Models of Finite Automata;International Journal of Foundations of Computer Science;2024-08-02
3. Languages Given by Finite Automata Over the Unary Alphabet;2024
4. Cellular Automata: Communication Matters;Lecture Notes in Computer Science;2024
5. Forgetting 1-Limited Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-15