Aspects of shuffle and deletion on trajectories

DOI10.1016/j.tcs.2004.09.038zbMath1070.68071OpenAlexW2156204758MaRDI QIDQ1770379

Lila Kari, Petr Sosík

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.038

zbMATH Keywords

binary word operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

Codes defined by multiple sets of trajectories ⋮ Block insertion and deletion on trajectories ⋮ On the complexity and decidability of some problems involving shuffle ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ RESTRICTED SETS OF TRAJECTORIES AND DECIDABILITY OF SHUFFLE DECOMPOSITIONS ⋮ Bond-free DNA language classes ⋮ On Language Decompositions and Primality ⋮ On properties of bond-free DNA languages ⋮ Language Decompositions, Primality, and Trajectory-Based Operations ⋮ State complexity of deletion and bipolar deletion ⋮ On bonded sequential and parallel insertion systems ⋮ Site-directed insertion: language equations and decision problems ⋮ Decidability of trajectory-based equations ⋮ Characterization and complexity results on jumping finite automata

Cites Work

• Deletion along trajectories
• Shuffle on trajectories: Syntactic constraints
• Unrestricted complementation in language equations over a one-letter alphabet
• On language equations with invertible operations
• Shuffle and scattered deletion closure of languages
• Language equations, maximality and error-detection
• Contexts on trajectories
• Mathematical Foundations of Computer Science 2004
• DNA Computing
• Theory Is Forever
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Aspects of shuffle and deletion on trajectories