Deletion along trajectories
From MaRDI portal
Publication:596097
DOI10.1016/j.tcs.2004.02.031zbMath1068.68077OpenAlexW2084807618MaRDI QIDQ596097
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.031
Related Items
Codes defined by multiple sets of trajectories ⋮ Nondeterministic state complexity of site-directed deletion ⋮ Block insertion and deletion on trajectories ⋮ The nondeterministic state complexity of the site-directed deletion language operation ⋮ RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS ⋮ Bond-free DNA language classes ⋮ On Language Decompositions and Primality ⋮ Aspects of shuffle and deletion on trajectories ⋮ On properties of bond-free DNA languages ⋮ Language Decompositions, Primality, and Trajectory-Based Operations ⋮ State complexity of deletion and bipolar deletion ⋮ OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS ⋮ Decidability of trajectory-based equations
Cites Work
- Maximal and minimal solutions to language equations
- Shuffle on trajectories: Syntactic constraints
- Regularity-preserving relations
- On language equations with invertible operations
- Shuffle and scattered deletion closure of languages
- Automata, Boolean matrices, and ultimate periodicity.
- SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES
- Regularity preserving modifications of regular expressions
- K-catenation and applications:k-prefix codes
- On the equivalence of linear conjunctive grammars and trellis automata
- On a family of linear grammars
- Quotients of Context-Free Languages
- Generalizations of regular events
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
