Skip to main content
SpringerLink
Log in

Logic and Branching Automata

  • Conference paper
Mathematical Foundations of Computer Science 2013 (MFCS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8087))

Abstract

The first result presented in this paper is the closure under complementation of the class of languages of finite N-free posets recognized by branching automata. Relying on this, we propose a logic, named Presburger-MSO or P-MSO for short, precisely as expressive as branching automata. The P-MSO theory of the class of all finite N-free posets is decidable.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bouajjani, A., Touili, T.: On computing reachability sets of process rewrite systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 484–499. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Richard Büchi, J.: Weak second-order arithmetic and finite automata. Zeit. Math. Logik. Grund. Math. 6, 66–92 (1960)

    Article  Google Scholar 

  3. Dal-Zilio, S., Lugiez, D.: XML Schema, Tree Logic and Sheaves Automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 246–263. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Ebbinghaus, H.-D., Flum, J.: Finite model theory, 2nd edn. Springer monographs in mathematics. Springer (1999)

    Google Scholar 

  5. Eilenberg, S., Schützenberger, M.-P.: Rational sets in commutative monoids. Journal of Algebra 13(2), 173–191 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  6. Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21–51 (1961)

    Article  MathSciNet  Google Scholar 

  7. Ésik, Z., Németh, Z.L.: Automata on series-parallel biposets. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 217–227. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16(2), 285–296 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hoogeboom, H.J., ten Pas, P.: Text languages in an algebraic framework. Fund. Inform. 25, 353–380 (1996)

    MathSciNet  MATH  Google Scholar 

  10. Hoogeboom, H.J., ten Pas, P.: Monadic second-order definable languages. Theory Comput. Syst. 30, 335–354 (1997)

    MathSciNet  MATH  Google Scholar 

  11. Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, McCarthy (eds.) Automata Studies, pp. 3–42. Princeton University Press, Princeton (1956)

    Google Scholar 

  12. Kuske, D.: Infinite series-parallel posets: Logic and languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 648–662. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Lodaya, K., Weil, P.: A Kleene iteration for parallelism. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 355–367. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Lodaya, K., Weil, P.: Series-parallel posets: algebra, automata and languages. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 555–565. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  15. Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoret. Comput. Sci. 237(1-2), 347–380 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Inform. Comput. 171, 269–293 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Presburger, M.: Über die vollstandigkeit eines gewissen systems der arithmetic ganzer zahlen, in welchem die addition als einzige operation hervortritt. In: Proc. Sprawozdaniez I Kongresu Matematykow Krajow Slowianskich, Warsaw, pp. 92–101 (1930); English translation: On the completeness of certain system of arithmetic of whole numbers in which addition occurs as the only operation. Hist. Philos. Logic 12, 92–101 (1991)

    Google Scholar 

  18. Sakarovitch, J.: Éléments de théorie des automates. Vuibert (2003); English (and revised) version: Elements of automata theory. Cambridge University Press (2009)

    Google Scholar 

  19. Seidl, H., Schwentick, T., Muscholl, A.: Counting in trees. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol. 2, pp. 575–612. Amsterdam University Press (2008)

    Google Scholar 

  20. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. III, pp. 389–455. Springer (1997)

    Google Scholar 

  21. Trakhtenbrot, B.A.: Finite automata and monadic second order logic. Siberian Math. 3, 101–131 (1962) (Russian) English translation in AMS Transl. 59, 23–55 (1966)

    Google Scholar 

  22. Valdes, J.: Parsing flowcharts and series-parallel graphs. Technical Report STAN-CS-78-682, Computer science departement of the Stanford University, Standford, Ca (1978)

    Google Scholar 

  23. Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11, 298–313 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITIS (EA CNRS 4108), Université de Rouen, France

    Nicolas Bedon

Authors
  1. Nicolas Bedon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Science and Technology, 3400, Klosterneuburg, Austria

    Krishnendu Chatterjee

  2. Charles University, 11800, Prague, Czech Republic

    Jirí Sgall

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bedon, N. (2013). Logic and Branching Automata. In: Chatterjee, K., Sgall, J. (eds) Mathematical Foundations of Computer Science 2013. MFCS 2013. Lecture Notes in Computer Science, vol 8087. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40313-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40313-2_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40312-5

  • Online ISBN: 978-3-642-40313-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation