Publisher
Springer International Publishing
Reference13 articles.
1. Birget, J.-C.: Two-way automata and length-preserving homomorphisms. Mathematical Systems Theory 29, 191–226 (1996)
2. Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R.M. (ed.) Complexity of Computation. AMS-SIAM Symposia in Applied Mathematics, vol. VII, pp. 43–73 (1974)
3. Geffert, V.: An alternating hierarchy for finite automata. Theoretical Computer Science 445, 1–24 (2012)
4. Immerman, N.: Descriptive complexity. Springer (1998)
5. Lecture Notes in Computer Science;C. Kapoutsis,2005
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Linear-time limited automata;Theoretical Computer Science;2019-12
2. Linear-Time Limited Automata;Descriptional Complexity of Formal Systems;2018