Splicing representations of stricly locally testable languages

DOI10.1016/S0166-218X(98)00053-5zbMath0906.68091MaRDI QIDQ1270777

Tom Head

Publication date: 25 January 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

DNA computingsplicing languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Protein sequences, DNA sequences (92D20)

Related Items (3)

Morphic characterizations of languages in Chomsky hierarchy with insertion and locality ⋮ New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality ⋮ Mutation systems

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• Computing by splicing
• DNA computing: Arrival of biological mathematics
• Simple splicing systems
• Splicing in abstract families of languages
• Regularity of splicing languages
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Splicing representations of stricly locally testable languages