The power of the Church-Rosser property for string rewriting systems

2005 ◽  
pp. 360-368 ◽  
Author(s):  
Ronald V. Book
Keyword(s):  
Rewriting Systems ◽  
String Rewriting ◽  
The Church

scholarly journals Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System

2021 ◽  
Vol 178 (3) ◽  
pp. 173-185
Author(s):  
Arthur Adinayev ◽  
Itamar Stein
Keyword(s):  
Isomorphism Problem ◽  
Complete Characterization ◽  
Hasse Diagram ◽  
Subgraph Isomorphism ◽  
Rewriting Systems ◽  
Rewriting System ◽  
String Rewriting ◽  
Reduction Graph

In this paper, we study a certain case of a subgraph isomorphism problem. We consider the Hasse diagram of the lattice Mk (the unique lattice with k + 2 elements and one anti-chain of length k) and find the maximal k for which it is isomorphic to a subgraph of the reduction graph of a given one-rule string rewriting system. We obtain a complete characterization for this problem and show that there is a dichotomy. There are one-rule string rewriting systems for which the maximal such k is 2 and there are cases where there is no maximum. No other intermediate option is possible.

scholarly journals String Rewriting Systems

2007 ◽  
Vol 15 (3) ◽  
Author(s):  
Michał Trybulec
Keyword(s):  
Rewriting Systems ◽  
String Rewriting

String-Rewriting Systems

1993 ◽  
pp. 35-64 ◽  
Author(s):  
Ronald V. Book ◽  
Friedrich Otto
Keyword(s):  
Rewriting Systems ◽  
String Rewriting

scholarly journals Deleting string rewriting systems preserve regularity

2004 ◽  
Vol 327 (3) ◽  
pp. 301-317 ◽  
Author(s):  
Dieter Hofbauer ◽  
Johannes Waldmann
Keyword(s):  
Rewriting Systems ◽  
String Rewriting
Sign in / Sign up

Export Citation Format

Share Document