JUCS - Journal of Universal Computer Science 8(2): 257-259, doi: 10.3217/jucs-008-02-0257
Shuffle Decomposition of Regular Languages
expand article infoMasami Ito‡
‡ Department of Mathematics, Kyoto Sangyo University, Kyoto, Japan

Corresponding author: Masami Ito ( ito@ksuvx0.kyoto-su.ac.jp )

© Masami Ito.
This article is freely available under the J.UCS Open Content License.
Citation: Ito M (2002) Shuffle Decomposition of Regular Languages. JUCS - Journal of Universal Computer Science 8(2): 257-259. https://doi.org/10.3217/jucs-008-02-0257
Open Access
Abstract
Let A X* be a regular language. In the paper, we will provide an algorithm to decide whether there exist a nontrivial language B (n, X) and a nontrivial regular language C X* such that A = B C 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen.
Keywords
regular language, shuffle product, shuffle decomposition, (nX)