About Connections Between Syntactical and Computational Complexity

We prove in this paper three kinds of results: 1/ It is undecidable whether a term rewriting system preserves recognizability. 2/ ground term rewriting systems with recognizable control are as powerfull as general rewriting systems. 3/ Influence on decidability and complexity of termination of syntactical restrictions on term rewriting systems reduced to one or two rules.

[1]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[2]  Max Dauchet,et al.  Théorie des Magmoïdes (II) , 1979, RAIRO Theor. Informatics Appl..

[3]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[4]  Simon Kaplan,et al.  Conditional Term Rewriting Systems , 1987, Lecture Notes in Computer Science.

[5]  Philippe Devienne,et al.  WEIGHTED GRAPHS, A Tool for Expressing the Behavious of Recursive Rules in Logic Programming , 1988, FGCS.

[6]  Jean-Pierre Jouannaud,et al.  Conditional Term Rewriting Systems: 1st International Workshop Orsay, France, July 8-10, 1987. Proceedings , 1988 .

[7]  Ronald V. Book,et al.  Formal language theory : perspectives and open problems , 1980 .

[8]  Philippe Devienne,et al.  Weighted Graphs: A Tool for Logic Programming , 1986, CAAP.

[9]  Sophie Tison,et al.  Decidability of the Confluence of Ground Term Rewriting Systems , 1985, LICS.

[10]  Hélène Kirchner,et al.  Construction D'un Plus Petit Odre de Simplification , 1984, RAIRO Theor. Informatics Appl..

[11]  Max Dauchet,et al.  A Gap Between Linear and Non Linear Term-Rewriting Systems (1) , 1987, RTA.

[12]  Max Dauchet,et al.  Termination of Rewriting is Undecidable in the One-Rule Case , 1988, MFCS.

[13]  Sheila A. Greibach,et al.  Control Sets of Context-Free Grammar Forms , 1977, J. Comput. Syst. Sci..

[14]  Hantao Zhang,et al.  Contextual Rewriting , 1985, RTA.

[15]  Gérard Huet,et al.  On the Uniform Halting Problem for Term Rewriting Systems , 1978 .

[16]  Ronald V. Book Thue Systems as Rewriting Systems , 1987, J. Symb. Comput..