scientific article

zbMath0785.68050MaRDI QIDQ4036781

Tom Head

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

automatagenetic algorithmsDNAregular languagessplicing systemsformal language theory

Mathematics Subject Classification ID

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

Related Items

Computing by splicing, On the splicing operation, Regularity of splicing languages, A characterization of (regular) circular languages generated by monotone complete splicing systems, Simple splicing systems, Splicing systems and the Chomsky hierarchy, Hybrid and generalized marked systems, The emerging discipline of biomolecular computation in the US, Logical string rewriting, Biomolecular realizations of a parallel architecture for solving combinatorial problems, Unavoidable sets and circular splicing languages, On the regularity of circular splicing languages: a survey and new developments, Splicing representations of stricly locally testable languages, A characterization of regular circular languages generated by marked splicing systems, Splicing in abstract families of languages, On the universality of Post and splicing systems, On the power of circular splicing, Separating some splicing models.