Advertisement

On the Expressive Power of FO[ + ]

  • Christian Choffrut
  • Andreas Malcher
  • Carlo Mereghetti
  • Beatrice Palano
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6031)

Abstract

The characterization of the class of FO[ + ]-definable languages by some generating or recognizing device is still an open problem. We prove that, restricted to bounded languages, this class coincides with the class of semilinear languages. We also study some closure properties of FO[ + ]-definable languages which, as a by-product, allow us to give an alternative proof that the Dyck languages cannot be defined in FO[ + ].

Keywords

Bounded languages semilinear sets first order logic 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barrington, D.M., Corbett, J.: On the relative complexity of some languages in NC. Information Processing Letters 32, 251–256 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Barrington, D.M., Immerman, N., Lautemann, C., Schweikardt, N., Thérien, D.: First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. Journal of Computer and System Sciences 70, 101–127 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Büchi, J.: Weak second order arithmetic and finite automata. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6, 66–92 (1960)zbMATHCrossRefGoogle Scholar
  4. 4.
    Chomsky, N., Schützenberger, M.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 118–161. North Holland, Amsterdam (1963)CrossRefGoogle Scholar
  5. 5.
    Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory 17, 13–27 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York (1966)zbMATHGoogle Scholar
  7. 7.
    Ginsburg, S., Spanier, E.: Bounded ALGOL-like languages. Trans. Amer. Math. Soc. 113, 333–368 (1964)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Harrison, M.: Introduction to Formal Languages. Addison-Wesley, Reading (1978)Google Scholar
  9. 9.
    Ibarra, O.: Simple matrix grammars. Information and Control 17, 359–394 (1970)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Ibarra, O.: A note on semilinear sets and bounded-reversal multihead pushdown automata. Information Processing Letters 3, 25–28 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Ibarra, O., Jiang, T., Ravikumar, B.: Some subclasses of context-free languages in NC1. Information Processing Letters 29, 111–117 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Robinson, D.: Parallel algorithms for group word problems. Doctoral Dissertation, Mathematics Dept., University of California, San Diego (1993)Google Scholar
  13. 13.
    Ruzzo, W.: On uniform circuit complexity. Journal of Computer and System Sciences 22, 365–383 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Straubing, H.: Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Basel (1994)zbMATHGoogle Scholar
  15. 15.
    Wegener, I.: The Complexity of Boolean Functions. Teubner, Stuttgart (1987)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Christian Choffrut
    • 1
  • Andreas Malcher
    • 2
  • Carlo Mereghetti
    • 3
  • Beatrice Palano
    • 3
  1. 1.LIAFAUMR 7089Paris 13France
  2. 2.Institut für InformatikUniversität GiessenGiessenGermany
  3. 3.DSIUniversità degli Studi di MilanoMilanoItaly

Personalised recommendations