Deciding whether a regular language is generated by a splicing system
From MaRDI portal
Publication:5200602
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.
Recommendations
Cited in
(9)- Language generating alphabetic flat splicing P systems
- scientific article; zbMATH DE number 2040901 (Why is no real title available?)
- Regular Splicing Languages Must Have a Constant
- Splicing systems and the Chomsky hierarchy
- Existence of constants in regular splicing languages
- Linear splicing and syntactic monoid
- On the overlap assembly of strings and languages
- Deciding whether a regular language is generated by a splicing system
- scientific article; zbMATH DE number 4125033 (Why is no real title available?)
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)