Formal languages
String-rewriting systems
On the regular structure of prefix rewriting
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
A note on decidability questions on presentations of word semigroups
Theoretical Computer Science - Special issue: formal language theory
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Deleting string rewriting systems preserve regularity
Theoretical Computer Science - Developments in language theory
Computation: finite and infinite machines
Computation: finite and infinite machines
Regular solutions of language inequalities and well quasi-orders
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Decision problems for language equations with Boolean operations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On language inequalities XK ⊆ LX
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
The power of commuting with finite sets of words
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Finite sets of words and computing
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
On Bifix Systems and Generalizations
Language and Automata Theory and Applications
The Reachability Problem over Infinite Graphs
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Computational power of two stacks with restricted communication
Information and Computation
Regularity and context-freeness over word rewriting systems
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Communication of two stacks and rewriting
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
| Hi-index | 0.00 |
We consider the power of the following rewriting: given a finite or regular set X of words and an initial word w, apply iteratively the operation which deletes a word from X from one of the ends of w and simultaneously catenates another word from X to the opposite end of w. We show that if the deletion is always done at the beginning and the catenation at the end, and the choice of a word to be catenated does not depend on the word erased, then the generated language is always regular, though the derivability relation is not, in general, rational. If the deletion and the catenation are done arbitrarily at the opposite ends, the language need not be regular. If the catenation is done at the same end as the deletion, the relation of derivability is rational even if the catenated word can depend on the word erased.