Deciding whether a regular language is generated by a splicing system

DOI10.1007/978-3-642-32208-2_8MaRDI QIDQ5200602zbMATH OpenOpenAlexFDO

Authors Lila Kari, Steffen Kopecki

Publication date 6 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1112.4897

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

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

• Deciding whether a regular language is generated by a splicing system
• scientific article; zbMATH DE number 1953224
• scientific article; zbMATH DE number 2040901
• Regularity of splicing languages
• On the power of circular splicing

Cited in

(9)

• scientific article; zbMATH DE number 2040901 (Why is no real title available?)
• Splicing systems and the Chomsky hierarchy
• Existence of constants in regular splicing languages
• scientific article; zbMATH DE number 4125033 (Why is no real title available?)
• Linear splicing and syntactic monoid
• Deciding whether a regular language is generated by a splicing system
• Regular Splicing Languages Must Have a Constant
• 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)