Prime decompositions of regular languages

Yo Sub Han, Kai Salomaa, Derick Wood

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

7 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
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

Fingerprint

Formal languages
Regular Languages
Decomposition
Decompose
Context free languages
Decomposable
Factorization
Context-free Languages
Unary
Language

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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.
Han, Yo Sub ; Salomaa, Kai ; Wood, Derick. / Prime decompositions of regular languages. Developments in Language Theory - 10th International Conference, DLT 2006, Proceedings. Springer Verlag, 2006. pp. 145-155 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{7b12702805674097aae4dab7ae8bdd59,
title = "Prime decompositions of regular languages",
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.",
author = "Han, {Yo Sub} and Kai Salomaa and Derick Wood",
year = "2006",
month = "1",
day = "1",
language = "English",
isbn = "354035428X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "145--155",
booktitle = "Developments in Language Theory - 10th International Conference, DLT 2006, Proceedings",
address = "Germany",

}

Han, YS, Salomaa, K & Wood, D 2006, Prime decompositions of regular languages. in Developments in Language Theory - 10th International Conference, DLT 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4036 LNCS, Springer Verlag, pp. 145-155, 10th International Conference on Developments in Language Theory, DLT 2006, Santa Barbara, CA, United States, 06/6/26.

Prime decompositions of regular languages. / Han, Yo Sub; Salomaa, Kai; Wood, Derick.

Developments in Language Theory - 10th International Conference, DLT 2006, Proceedings. Springer Verlag, 2006. p. 145-155 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4036 LNCS).

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

TY - GEN

T1 - Prime decompositions of regular languages

AU - Han, Yo Sub

AU - Salomaa, Kai

AU - Wood, Derick

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746254895&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746254895&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33746254895

SN - 354035428X

SN - 9783540354284

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 145

EP - 155

BT - Developments in Language Theory - 10th International Conference, DLT 2006, Proceedings

PB - Springer Verlag

ER -

Han YS, Salomaa K, Wood D. Prime decompositions of regular languages. In Developments in Language Theory - 10th International Conference, DLT 2006, Proceedings. Springer Verlag. 2006. p. 145-155. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).