Splicing systems and regularity
From MaRDI portal
Publication:4009701
DOI10.1080/00207168908803788zbMath0825.68443MaRDI QIDQ4009701
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
68Q45: Formal languages and automata
68W10: Parallel algorithms in computer science
92-XX: Biology and other natural sciences
Related Items
Circular splicing and regularity, Descriptional Complexity of Semi-simple Splicing Systems, Descriptional Complexity of Semi-Simple Splicing Systems, Deciding whether a regular language is generated by a splicing system, Finite-state automata in information technologies, Recognizing splicing languages: syntactic monoids and simultaneous pumping, Computing by splicing, Simple splicing systems, Splicing in abstract families of languages, On the universality of Post and splicing systems, On the splicing operation, On the overlap assembly of strings and languages, Restricted use of the splicing operation1
Cites Work