Splicing systems and the Chomsky hierarchy - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2012

Splicing systems and the Chomsky hierarchy


In this paper, we prove decidability properties and new results on the position of the family of languages generated by (circular) splicing systems within the Chomsky hierarchy. The two main results of the paper are the following. First, we show that it is decidable, given a circular splicing language and a regular language, whether they are equal. Second, we prove the language generated by an alphabetic splicing system is context-free. Alphabetic splicing systems are a generalization of simple and semi-simple splicing systems already considered in the literature.

Dates and versions

hal-00737873 , version 1 (02-10-2012)



Jean Berstel, Luc Boasson, Isabelle Fagnot. Splicing systems and the Chomsky hierarchy. Theoretical Computer Science, 2012, 436 (1), pp.2-22. ⟨10.1016/j.tcs.2012.03.008⟩. ⟨hal-00737873⟩
114 View
0 Download



Gmail Facebook Twitter LinkedIn More