文章基本信息

标题：Shuffle Decomposition of Regular Languages
作者：Masami Ito
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：2002
卷号：8
期号：2
页码：257-259
出版社：Graz University of Technology and Know-Center
摘要：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.