Splicing systems and regularity

DOI10.1080/00207168908803788zbMATH Open0825.68443OpenAlexW2064361119MaRDI QIDQ4009701FDOQ4009701

Authors: R. W. Gatterdam 

Publication date: 27 September 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803788

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biology and other natural sciences (92-XX) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Algorithms for Splicing Systems

Cited In (13)

• On the universality of Post and splicing systems
• Descriptional complexity of semi-simple splicing systems
• Simple splicing systems
• Computing by splicing
• Circular splicing and regularity
• Restricted use of the splicing operation¹
• Finite-state automata in information technologies
• Splicing in abstract families of languages
• Deciding whether a regular language is generated by a splicing system
• Recognizing splicing languages: syntactic monoids and simultaneous pumping
• On the overlap assembly of strings and languages
• On the splicing operation
• Descriptional Complexity of Semi-Simple Splicing Systems

This page was built for publication: Splicing systems and regularity

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