Sciweavers

DLT
2006
14 years 9 days ago
Prime Decompositions of Regular Languages
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...
Yo-Sub Han, Kai Salomaa, Derick Wood