Skip to main content
SpringerLink
Log in

On Equivalent Representations of Infinite Structures

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2719))

Included in the following conference series:

Abstract

According to Barthelman and Blumensath, the following families of infinite graphs are isomorphic: (1) prefix-recognisable graphs, (2) graph solutions of VR equational systems and (3) MS interpretations of regular trees. In this paper, we consider the extension of prefix-recognisable graphs to prefix-recognisable structures and of graphs solutions of VR equational systems to structures solutions of positive quantifier free definable (PQFD) equational systems. We extend Barthelman and Blumensath’s result to structures parameterised by infinite graphs by proving that the following families of structures are equivalent: (1) prefix-recognisable structures restricted by a language accepted by an infinite deterministic automaton, (2) solutions of infinite PQFD equational systems and (3) MS interpretations of the unfoldings of infinite deterministic graphs. Furthermore, we show that the addition of a fuse operator, that merges several vertices together, to PQFD equational systems does not increase their expressive power.

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. K. Barthelmann. On equational simple graphs. Technical Report 9, Universität Mainz, Institut für Informatik, 1997.

    Google Scholar 

  2. A. Blumensath. Automatic structures. Diploma thesis, RWTH-Aachen, 1999.

    Google Scholar 

  3. A. Blumensath. Prefix-recognisable graphs and monadic second-order logic. Technical Report AIB-06-2001, RWTH Aachen, May 2001.

    Google Scholar 

  4. D. Caucal. On the regular structure of prefix rewriting. TCS, 106:61–86, 1992.

    Article  MathSciNet  Google Scholar 

  5. D. Caucal. On infinite transition graphs having a decidable monadic theory. In ICALP’96, volume 1099 of LNCS, pages 194–205, 1996.

    Google Scholar 

  6. B. Courcelle and J.A Makowsky. Fusion in relational structures and the verification of msologic. In MSCS, volume 12, pages 203–235, 2002.

    MATH  MathSciNet  Google Scholar 

  7. T. Colcombet. On families of graphs having a decidable first order theory with reachability. In ICALP’02, 2002.

    Google Scholar 

  8. B. Courcelle. The monadic second-order logic of graphs ii: infinite graphs of bounded tree width. Math. Systems Theory, 21:187–221, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  9. B. Courcelle. Handbook of Theoretical Computer Science, chapter Graph rewriting: an algebraic and logic approach. Elsevier, 1990.

    Google Scholar 

  10. B. Courcelle. Monadic-second order definable graph transductions: a survey. TCS, vol. 126:pp. 53–75, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  11. B. Courcelle and I. Walukiewicz. Monadic second-order logic, graph coverings and unfoldings of transition systems. In Annals of Pure and Applied Logic, 1998.

    Google Scholar 

  12. M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Fifth Annual IEEE Symposium on Logic in Computer Science, pages 242–248, 1990.

    Google Scholar 

  13. C. L ding. Ground tree rewriting graphs of bounded tree width. In Stacs O2. LNCS, 2002.

    Google Scholar 

  14. C. Morvan. On rational graphs. In J. Tiuryn, editor, FOSSACS’00, volume 1784 of LNCS, pages 252–266, 2000.

    Google Scholar 

  15. D. Muller and P. Schupp. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science, 37:51–75, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  16. G. S nizergues. Definability in weak monadic second-order logic of some infinite graphs. In Dagstuhl seminar on Automata theory: Infinite computations, Warden, Germany, volume 28, page 16, 1992.

    Google Scholar 

  17. W. Thomas. Languages, automata, and logic. Handbook of Formal Language Theory, 3:389–455, 1997.

    Google Scholar 

  18. T. Urvoy. On abstract families of graphs. In DLT 02, 2002.

    Google Scholar 

  19. I. Walukiewicz. Monadic second order logic on tree-like structures. In STACS’96, volume 1046 of LNCS, pages 401–414, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Irisa, Campus universitaire de Beaulieu, 35042, Rennes Cedex, France

    Arnaud Carayol & Thomas Colcombet

Authors
  1. Arnaud Carayol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Colcombet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten

  2. School of Industrial and Systems Engineering, Georgia Institute of Technology, 765 Ferst Drive, Atlanta, GA, 30332-0205, USA

    Jan Karel Lenstra

  3. Department of Information Technology, Uppsala University, P.O. Box 337, 75105, Uppsala, Sweden

    Joachim Parrow

  4. Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Gerhard J. Woeginger

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carayol, A., Colcombet, T. (2003). On Equivalent Representations of Infinite Structures. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds) Automata, Languages and Programming. ICALP 2003. Lecture Notes in Computer Science, vol 2719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45061-0_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-45061-0_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40493-4

  • Online ISBN: 978-3-540-45061-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation