Skip to main content
SpringerLink
Log in

A String-Rewriting Characterization of Muller and Schupp’s Context-Free Graphs

  • Conference paper
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1998)

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

Abstract

This paper introduces Thue specifications, an approach for string-rewriting description of infinite graphs. It is shown that strongly reduction-bounded and unitary reduction-bounded rational Thue specifications have the same expressive power and both characterize the context-free graphs of Muller and Schupp. The problem of strong reduction-boundedness for rational Thue specifications is shown to be undecidable but the class of unitary reduction-bounded rational Thue specifications, that is a proper subclass of strongly reduction-bounded rational Thue specifications, is shown to be recursive.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Barthelmann, K.: On equational simple graphs. Technical Report 9/97, Johannes Gutenberg Universität, Mainz (1997)

    Google Scholar 

  2. Book, R.V., Otto, F.: String–Rewriting Systems. Texts and Monographs in Computer Science. Springer, Heidelberg (1993)

    Google Scholar 

  3. Calbrix, H., Knapik, T.: On a class of graphs of semi–Thue systems having decidable monadic second–order theory. Technical Report INF/1998/01/01/a, IREMIA, Université de la Réunion (1998)

    Google Scholar 

  4. Caucal, D.: On the regular structure of prefix rewriting. Theoretical Comput. Sci. 106, 61–86 (1992)

    Article  MathSciNet  Google Scholar 

  5. Caucal, D.: On infinite transition graphs having a decidable monadic second– order theory. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 194–205. Springer, Heidelberg (1996)

    Google Scholar 

  6. Courcelle, B.: The monadic second–order logic of graphs, II: Infinite graphs of bounded width. Mathematical System Theory 21, 187–221 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  7. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Formal Models and Semantics, Handbook of Theoretical Computer Science, vol. B, pp. 193–242. Elsevier, Amsterdam (1990)

    Google Scholar 

  8. Courcelle, B.: The monadic second–order theory of graphs IX: Machines and their behaviours. Theoretical Comput. Sci. 151, 125–162 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. Engelfriet, J.: Contex–free graph grammars. In: Rozenberg, G., Salomaa, A. (eds.) Beyond Words, Handbook of Formal Languages, vol. 3, pp. 125–213. Springer, Heidelberg (1997)

    Google Scholar 

  10. Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial approach to the specification, correctness and implementation of abstract data types. In: Yeh, R.T. (ed.) Data Structuring, Current Trends in Programming Methodology, vol. 4, pp. 80–149. Prentice Hall, Englewood Cliffs (1978)

    Google Scholar 

  11. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison–Wesley, London (1979)

    MATH  Google Scholar 

  12. Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata and second–order logic. Theoretical Comput. Sci. 37, 51–75 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  13. Otto, F.: On the property of preserving regularity for string–rewriting systems. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 83–97. Springer, Heidelberg (1997)

    Google Scholar 

  14. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 1. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  15. Sénizergues, G.: Formal languages and word rewriting. In: Comon, H., Jouannaud, J.-P. (eds.) TCS School 1993. LNCS, vol. 909, pp. 75–94. Springer, Heidelberg (1995)

    Google Scholar 

  16. Squier, C.C., Otto, F., Kobayashi, Y.: A finiteness condition for rewriting systems. Theoretical Comput. Sci. 131(2), 271–294 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  17. Thue, A.: Probleme über veränderungen von zeichenreihen nach gegebenen regeln. Skr. Vid. Kristiania, I Mat. Natuv. Klasse 10, 34 (1914)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College Jean Lecanuet, BP 1024, 76171, Rouen Cedex, France

    Hugues Calbrix

  2. IREMIA, Université de la Réunion, BP 7151, 97715, Saint Denis Messageries Cedex 9, Réunion

    Teodor Knapik

Authors
  1. Hugues Calbrix
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Teodor Knapik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Sciences, 600 113, Chennai, India

    Vikraman Arvind

  2. National Institute of Advanced Studies, Indian Institute of Science Campus, 560012, Bangalore, India

    Sundar Ramanujam

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calbrix, H., Knapik, T. (1998). A String-Rewriting Characterization of Muller and Schupp’s Context-Free Graphs. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-49382-2_31

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49382-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation