896 search results - page 1 / 180 » On completeness of word reversing |
DM
2000
13 years 4 months ago
2000
Word reversing is a combinatorial operation on words that detects pairs of equivalent words in monoids that admit a presentation of a certain form. Here we give conditions for this...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent: (I) all complete returns to palindromes...
IJAC
2011
12 years 8 months ago
2011
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
ENTCS
2008
13 years 4 months ago
2008
In this paper we study the relation between reversible and irreversible computation applicable to different models of computation -- here we are considering classical and quantum ...
CAI
2009
Springer
13 years 2 months ago
2009
Springer
This paper studies conditions under which the operation of parallel insertion can be reversed by parallel deletion, i.e., when does the equality (L1 L2) L2 = L1 hold for language...