Regularity of splicing languages

DOI10.1016/0166-218X(95)00079-7zbMath0855.68052MaRDI QIDQ1923604

Dennis Pixton

Publication date: 14 January 1997

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

zbMATH Keywords

splicing

Mathematics Subject Classification ID

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

Related Items

Descriptional Complexity of Semi-simple Splicing Systems, Accepting splicing systems with permitting and forbidding words, Non-preserving splicing with delay, Constants and label-equivalence: a decision procedure for reflexive regular splicing languages, Deciding whether a regular language is generated by a splicing system, Circular splicing and regularity, Aparallel digraphs and splicing machines, A characterization of (regular) circular languages generated by monotone complete splicing systems, Recognizing splicing languages: syntactic monoids and simultaneous pumping, Simple splicing systems, Descriptional Complexity of Semi-Simple Splicing Systems, Splicing systems and the Chomsky hierarchy, DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS, Time and space complexity for splicing systems, Complexity theory for splicing systems, Splicing systems with targets are computationally universal, Unnamed Item, Regular splicing languages and subclasses, Linear splicing and syntactic monoid, Accepting splicing systems, Multiple splicing systems and the universal computability, The structure of reflexive regular splicing languages via Schützenberger constants, An alternative definition of splicing, Formal properties of PA-matching, On the regularity of circular splicing languages: a survey and new developments, DNA Splicing Systems, Cut, paste and filter., Splicing Systems: Accepting Versus Generating, Splicing representations of stricly locally testable languages, On the overlap assembly of strings and languages, Splicing on tree-like structures, A characterization of regular circular languages generated by marked splicing systems, Splicing in abstract families of languages, DNA computing based on splicing: Universality results, On the universality of Post and splicing systems, On the power of circular splicing, Topics in the theory of DNA computing., Existence of constants in regular splicing languages, Separating some splicing models.

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Splicing semigroups of dominoes and DNA
• On the splicing operation
• Unnamed Item
• Unnamed Item
• Unnamed Item