You are here: TUCS > PUBLICATIONS > Publication Search > Computing by Commuting
- TUCS Publication Series
- How to Publish in TUCS Series
- Publication Search
- Publication Graph
- Publication Input
- Publication Input Guide
- JuFo Browser
Computing by Commuting
Juhani Karhumäki, Michal Kunc, Alexander Okhotin, Computing by Commuting. TUCS Technical Reports 733, Turku Centre for Computer Science, 2005.
Abstract:
We consider the power of the following rewriting: given a finite or regular set <i>X</i> of words and an initial word <i>w</i>, apply iteratively the operation which deletes a word from <i>X</i> from one of the ends of <i>w</i> and simultaneously catenates another word from <i>X</i> to the opposite end of <i>w</i>. 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.
Files:
Full publication in PDF-format
BibTeX entry:
@TECHREPORT{tKaKuOk05a,
title = {Computing by Commuting},
author = {Karhumäki, Juhani and Kunc, Michal and Okhotin, Alexander},
number = {733},
series = {TUCS Technical Reports},
publisher = {Turku Centre for Computer Science},
year = {2005},
keywords = {Rewriting systems, regular languages, commutation of languages, rational relations},
ISBN = {952-12-1658-1},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics