On codes defined by bio-operations

Authors:
Mark Daley;Michael Domaratzki
Affiliations:
Department of Computer Science, University of Western Ontario, London, ON, Canada;Jodrey School of Computer Science, Acadia University, Wolfville, NS, Canada
Venue:
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Year:
2004

Citing 10
Cited 1

On language equations with invertible operations

Theoretical Computer Science
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Morphisms

Handbook of formal languages, vol. 1
Codes

Handbook of formal languages, vol. 1
Codes, Involutions, and DNA Encodings

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Synchronized Shuffle and Regular Languages

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Closure and decidability properties of some language classes with respect to ciliate bio-operations

Theoretical Computer Science
Trajectory-based codes

Acta Informatica
Families of languages defined by ciliate bio-operations

Theoretical Computer Science
Some properties of ciliate bio-operations

DLT'02 Proceedings of the 6th international conference on Developments in language theory

On codes defined by bio-operations

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the classes of ⊕-codes and⊗-codes, which are superclasses of outfix and hypercodes, respectively. These restrictions are based on the synchronized insertion operation, which serves as a model for the gene rearrangement function in certain unicellular organisms. We investigate the classes of ⊕-codes and⊗-codes from a theoretical perspective, examine their relationships with traditional code classes and consider related decidability problems.