Prime decompositions of regular languages

Yo Sub Han, Kai Salomaa, Derick Wood

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing the language yields a prime decomposition in a finite number of steps. We give a characterization of the strongly prime decomposable regular languages and using the characterization we show that every regular language over a unary alphabet has a prime decomposition. We show that there exist co-context-free languages that do not have prime decompositions.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 10th International Conference, DLT 2006, Proceedings
PublisherSpringer Verlag
Pages145-155
Number of pages11
ISBN (Print)354035428X, 9783540354284
DOIs
Publication statusPublished - 2006 Jan 1
Event10th International Conference on Developments in Language Theory, DLT 2006 - Santa Barbara, CA, United States
Duration: 2006 Jun 262006 Jun 29

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4036 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Developments in Language Theory, DLT 2006
CountryUnited States
CitySanta Barbara, CA
Period06/6/2606/6/29

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Prime decompositions of regular languages'. Together they form a unique fingerprint.

  • Cite this

    Han, Y. S., Salomaa, K., & Wood, D. (2006). Prime decompositions of regular languages. In Developments in Language Theory - 10th International Conference, DLT 2006, Proceedings (pp. 145-155). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4036 LNCS). Springer Verlag. https://doi.org/10.1007/11779148_14