Abstract
Let 1N and SN be the classes of families of problems solvable by families of polynomial-size one-way and sweeping nondeterministic finite automata, respectively. We characterize 1N in terms of families of polynomial-length formulas of monadic second-order logic with successor. These formulas existentially quantify two local conditions in disjunctive normal form: one on cells polynomially away from the two ends of the input, and one more on the cells of a fixed-width window sliding along it. We then repeat the same for SN and for slightly more complex formulas.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Birget, J.-C.: Two-way automata and length-preserving homomorphisms. Mathematical Systems Theory 29, 191–226 (1996)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and real computation. Springer (1997)
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)
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)
Immerman, N.: Descriptive complexity. Springer (1998)
Kapoutsis, C.A.: Size Complexity of Two-Way Finite Automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 47–66. Springer, Heidelberg (2009)
Kapoutsis, C., Královič, R., Mömke, T.: Size complexity of rotating and sweeping automata. Journal of Computer and System Sciences 78(2), 537–558 (2012)
Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)
Reinhardt, K.: The Complexity of Translating Logic to Finite Automata. In: Grädel, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol. 2500, pp. 231–238. Springer, Heidelberg (2002)
Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of STOC, pp. 275–286 (1978)
Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences 25(3), 360–376 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kapoutsis, C.A., Lefebvre, N. (2012). Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata. In: Yen, HC., Ibarra, O.H. (eds) Developments in Language Theory. DLT 2012. Lecture Notes in Computer Science, vol 7410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31653-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-31653-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31652-4
Online ISBN: 978-3-642-31653-1
eBook Packages: Computer ScienceComputer Science (R0)