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

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.

[1]  Friedrich Otto.  On the Property of Preserving Regularity for String-Rewriting Systems , 1997, RTA.

[2]  Aart Middeldorp,et al.  Term Rewriting , 1999, CSL.

[3]  Didier Caucal,et al.  On the Regular Structure of Prefix Rewriting , 1990, Theor. Comput. Sci..

[4]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics , 1994 .

[5]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours , 1995, Theor. Comput. Sci..

[6]  Géraud Sénizergues,et al.  Formal Languages and Word-Rewriting , 1993, Term Rewriting.

[7]  Friedrich Otto,et al.  A Finiteness Condition for Rewriting Systems , 1994, Theor. Comput. Sci..

[8]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[9]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[10]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Friedrich Otto,et al.  String-Rewriting Systems , 1993, Text and Monographs in Computer Science.

[13]  David E. Muller,et al.  The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[14]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.