A parallel algorithm for the decomposition of finite languages
Tomasz Jastrząb, Zbigniew J. Czech · 2015
A finite language is said to be decomposable, if it can be written as a catenation of two non-empty languages. In this paper a parallel algorithm for finding the decomposition of finite languages is proposed. The effectiveness of the algorithm is assessed based on the experimental results provided for selected languages.