Regular Splicing Languages Must Have a Constant

  • Paola Bonizzoni
  • Natasha Jonoska
Conference paper

DOI: 10.1007/978-3-642-22321-1_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6795)
Cite this paper as:
Bonizzoni P., Jonoska N. (2011) Regular Splicing Languages Must Have a Constant. In: Mauri G., Leporati A. (eds) Developments in Language Theory. DLT 2011. Lecture Notes in Computer Science, vol 6795. Springer, Berlin, Heidelberg


In spite of wide investigations of finite splicing systems in formal language theory, basic questions, such as their characterization, remain unsolved. In search for understanding the class of finite splicing systems, it has been conjectured that a necessary condition for a regular language L to be a splicing language is that L must have a constant in the Schützenberger’s sense. We prove this longstanding conjecture to be true. The result is based on properties of strongly connected components of the minimal deterministic finite state automaton for a regular splicing language.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Paola Bonizzoni
    • 1
  • Natasha Jonoska
    • 2
  1. 1.Dipartimento di Informatica Sistemistica e ComunicazioneUniv. degli Studi di Milano - BicoccaMilanoItaly
  2. 2.Department of Mathematics and StatisticsUniversity of South FloridaTampaUSA

Personalised recommendations