Splicing systems: Regularity and below

DOI10.1007/3-540-36440-4_23MaRDI QIDQ4414686zbMATH OpenFDO

Authors Tom Head, Dennis Pixton, Elizabeth Goode

Publication date 25 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2568/25680262.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Recommendations

• Circular splicing and regularity
• Splicing systems and the Chomsky hierarchy
• scientific article; zbMATH DE number 1836435
• Splicing systems: accepting versus generating
• Accepting splicing systems
• scientific article; zbMATH DE number 1836439
• DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
• Simple splicing systems
• scientific article; zbMATH DE number 1836433
• scientific article; zbMATH DE number 935111

Cited in

(12)

• On the overlap assembly of strings and languages
• Existence of constants in regular splicing languages
• Regular splicing languages and subclasses
• An alternative definition of splicing
• Deciding whether a regular language is generated by a splicing system
• A Decision Procedure for Reflexive Regular Splicing Languages
• Regular languages generated by reflexive finite splicing systems
• scientific article; zbMATH DE number 1836433 (Why is no real title available?)
• Deciding whether a regular language is generated by a splicing system
• Aspects of Molecular Computing
• A study on mathematical model of n-th order limit language from a biological perspective via wet-lab experiment
• Recognizing splicing languages: syntactic monoids and simultaneous pumping

This page was built for publication: Splicing systems: Regularity and below

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414686)