Subject
General Computer Science,Theoretical Computer Science
Reference31 articles.
1. Searching constant width mazes captures the AC0 hierarchy;Barrington,1998
2. Intersection and union of regular languages and state complexity;Birget;Inform. Process. Lett.,1992
3. Games, equations and the dot-depth hierarchy;Blanchet-Sadri;Comput. Math. Appl.,1989
4. Syntactic complexity of R- and J-trivial regular languages;Brzozowski;Internat. J. Found. Comput. Sci.,2014
5. Finite-automaton aperiodicity is PSPACE-complete;Cho;Theoret. Comput. Sci.,1991
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献