On the decomposition of finite languages

@inproceedings{Salomaa1999OnTD,
  title={On the decomposition of finite languages},
  author={Arto Salomaa and Sheng Yu},
  booktitle={Developments in Language Theory},
  year={1999}
}
Representations of nite languages as a product (catenation) of languages are investigated, where the factor languages are \prime", that is, cannot be decomposed further in a nontrivial manner. In general, such prime decom-positions are not unique-even the number of factors can vary exponentially. The paper investigates the uniqueness of prime decompositions, as well as the commuting of the factors. Interconnections to languages more general than nite are pointed out. In the case of regular… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
36 Extracted Citations
7 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-7 of 7 references

Free Monoids and Languages

  • H J Shyr
  • Free Monoids and Languages
  • 1991

Theoret. Comput. Sci

  • W Bucher, H A Maurer, K Culik, Ii, D Wotschke
  • Theoret. Comput. Sci
  • 1981

Theory of Automata

  • A Salomaa
  • International Series of Monographs in Pure and…
  • 1969

Turku Centre for Computer Science Lemminkk aisenkatu 14 FIN-20520 Turku Finland http://www.tucs.abo

  • Turku Centre for Computer Science Lemminkk…

Similar Papers

Loading similar papers…