Splicing systems and regularity

DOI10.1080/00207168908803788zbMath0825.68443OpenAlexW2064361119MaRDI QIDQ4009701

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) Parallel algorithms in computer science (68W10) Biology and other natural sciences (92-XX)

Related Items (13)

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

Cites Work

• Unnamed Item
• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• Algorithms for Splicing Systems

This page was built for publication: Splicing systems and regularity