Regularity of splicing languages

From MaRDI portal
Publication:1923604


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)


68Q45: Formal languages and automata

92D20: Protein sequences, DNA sequences


Related Items

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



Cites Work