Author:
Kapoutsis Christos A.,Lefebvre Nans
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Birget, J.-C.: Two-way automata and length-preserving homomorphisms. Mathematical Systems Theory 29, 191–226 (1996)
2. Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer (1997)
3. Büchi, R.J.: Weak second-order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6(1-6), 66–92 (1960)
4. 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)
5. Immerman, N.: Descriptive complexity. Springer (1998)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Logical Characterization of Small 2NFAs;International Journal of Foundations of Computer Science;2017-08
2. A Logical Characterization of Small 2NFAs;Implementation and Application of Automata;2016
3. Predicate Characterizations in the Polynomial-Size Hierarchy;Language, Life, Limits;2014