On language equations with invertible operations
Theoretical Computer Science
Maximal and minimal solutions to language equations
Journal of Computer and System Sciences
Contextual insertions/deletions and computability
Information and Computation
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
On some operations on strings suggested by gene assembly in ciliates
New Generation Computing
Patterns of Micronuclear Genes in ciliates
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Closure and decidability properties of some language classes with respect to ciliate bio-operations
Theoretical Computer Science
Decidability of trajectory-based equations
Theoretical Computer Science - Mathematical foundations of computer science 2004
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Finite automata and their decision problems
IBM Journal of Research and Development
Semantic shuffle on and deletion along trajectories
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Block insertion and deletion on trajectories
Theoretical Computer Science
Computing maximal Kleene closures that are embeddable in a given constrained DNA language
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Hi-index | 0.00 |
We propose a general framework for parallel insertion/deletion operations based on p-schemata. A p-schema is a set of tuples of words. When being used for parallel insertion of a language into a word, an element of a p-schema specifies how to split the given word into factors between which the insertion of the language will take place. Parallel deletion based on a p-schema is defined as an "inverse" operation of parallel insertion based on the p-schema. Several well-known language operations are particular cases of p-schema-based insertions or deletions: catenation, Kleene star, reverse catenation, sequential insertion, parallel insertion, insertion next to a given letter, contextual insertion, right and left quotient, sequential deletion, parallel deletion. Additional operations that can be defined using p-schemata include contextual parallel insertion, as well as parallel insertion (deletion) of exactly n words, at most n words, an arbitrary number of words. We also consider the decidability and undecidability of existence of solutions of language equations involving p-schema-based parallel insertion/deletion.