Deciding whether a regular language is generated by a splicing system
From MaRDI portal
Publication:5200602
DOI10.1007/978-3-642-32208-2_8zbMATH Open1372.68101arXiv1112.4897OpenAlexW2737619095MaRDI QIDQ5200602FDOQ5200602
Authors: Lila Kari, Steffen Kopecki 
Publication date: 6 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Abstract: Splicing as a binary word/language operation is inspired by the DNA recombination under the action of restriction enzymes and ligases, and was first introduced by Tom Head in 1987. Shortly thereafter, it was proven that the languages generated by (finite) splicing systems form a proper subclass of the class of regular languages. However, the question of whether or not one can decide if a given regular language is generated by a splicing system remained open. In this paper we give a positive answer to this question. Namely, we prove that, if a language is generated by a splicing system, then it is also generated by a splicing system whose size is a function of the size of the syntactic monoid of the input language, and which can be effectively constructed.
Full work available at URL: https://arxiv.org/abs/1112.4897
Recommendations
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (9)
- Title not available (Why is that?)
- Splicing systems and the Chomsky hierarchy
- Existence of constants in regular splicing languages
- Title not available (Why is that?)
- Linear splicing and syntactic monoid
- Regular Splicing Languages Must Have a Constant
- Deciding whether a regular language is generated by a splicing system
- On the overlap assembly of strings and languages
- Language generating alphabetic flat splicing P systems
This page was built for publication: Deciding whether a regular language is generated by a splicing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200602)
