@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",
doi = "10.1007/11779148_14",
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",
note = "10th International Conference on Developments in Language Theory, DLT 2006 ; Conference date: 26-06-2006 Through 29-06-2006",
}