Author:
Kutrib Martin,Malcher Andreas,Pighizzini Giovanni
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference36 articles.
1. On the Complexity of Regular Languages in Terms of Finite Automata;Berman,1977
2. A note on sweeping automata;Berman,1980
3. Intersection and union of regular languages and state complexity;Birget;Inf. Process. Lett.,1992
4. Finite automata and unary languages;Chrobak;Theor. Comput. Sci.,1986
5. Nondeterministic computations in sublogarithmic space and space constructibility;Geffert;SIAM J. Comput.,1991
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Hot Current Topics of Descriptional Complexity;IFIP Advances in Information and Communication Technology;2021