On language equations with invertible operations
Theoretical Computer Science
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
Handbook of Formal Languages
Theory of Codes
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
Acta Informatica
Families of languages defined by ciliate bio-operations
Theoretical Computer Science
On properties of bond-free DNA languages
Theoretical Computer Science
Bond-free DNA language classes
Natural Computing: an international journal
Some properties of ciliate bio-operations
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Hairpin structures defined by DNA trajectories
DNA'06 Proceedings of the 12th international conference on DNA Computing
On codes defined by bio-operations
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Characterizing DNA bond shapes using trajectories
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Hi-index | 5.23 |
We consider the classes of @?-codes and @?-codes, which are superclasses of outfix and hyper-codes, 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.