Han, Yo-Sub Salomaa, Kai Wood, Derick 2024-01-21T03:00:27Z 2024-01-21T03:00:27Z 2021-09-02 2006-07 0302-9743 https://pubs.kist.re.kr/handle/201004/135358 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. English SPRINGER-VERLAG BERLIN EQUATIONS AUTOMATA Prime decompositions of regular languages Article 1 DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, v.4036, pp.145 - 155 DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS 4036 145 155 scie scopus 000239454100014 2-s2.0-33746254895 Computer Science, Theory & Methods Computer Science Article; Proceedings Paper EQUATIONS AUTOMATA prime decomposition regular languages