Families of languages defined by ciliate bio-operations

DOI10.1016/j.tcs.2004.03.043zbMath1068.68076OpenAlexW1988175546MaRDI QIDQ596126

Lila Kari, Ian McQuillan, Mark Daley

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.03.043

zbMATH Keywords

Closure propertiesquestionsBio-operationsDecisionTheoretical DNA computing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

The chop of languages ⋮ On codes defined by bio-operations ⋮ Pseudo-inversion: closure properties and decidability ⋮ Gaining Power by Input Operations: Finite Automata and Beyond ⋮ On decidability and closure properties of language classes with respect to bio-operations ⋮ INTRA-MOLECULAR TEMPLATE-GUIDED RECOMBINATION

Cites Work

• The complexity of decision problems for finite-turn multicounter machines
• Reversal-bounded multipushdown machines
• Closure and decidability properties of some language classes with respect to ciliate bio-operations.
• Template-guided DNA recombination
• Some decision problems concerning semilinearity and commutation.
• Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Finite-Turn Pushdown Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item