String-rewriting systems
Handbook of formal languages, vol. 1
Some undecidability results concerning the property of preserving regularity
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
Journal of the ACM (JACM)
Proving termination with multiset orderings
Communications of the ACM
Peg-Solitaire, String Rewriting Systems and Finite Automata
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Tree Automata and Term Rewrite Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Deleting string rewriting systems preserve regularity
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Closure of Hedge-Automata Languages by Hedge Rewriting
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
On Regularity-Preservation by String-Rewriting Systems
Language and Automata Theory and Applications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Computational power of two stacks with restricted communication
Information and Computation
Computing by observing: Simple systems and simple observers
Theoretical Computer Science
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Information and Computation
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Communication of two stacks and rewriting
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Observation of String-Rewriting Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |
A string rewriting system is called deleting if there exists a partial ordering on its alphabet such that each letter in the right-hand side of a rule is less than some letter in the corresponding left-hand side. We show that the rewrite relation induced by a deleting system can be represented as the composition of a finite substitution (into an extended alphabet), a rewrite relation of an inverse context-free system (over the extended alphabet), and a restriction (to the original alphabet). Here, a system is called inverse context-free if the length of the right-hand side of any rule does not exceed one. The decomposition result directly implies that deleting systems preserve regularity and that inverse deleting systems preserve context-freeness. The latter result was already obtained by Hibbard (J. ACM 21(3) (1974) 446-453).