文章基本信息

标题：Decidable and Undecidable Problems of Primitive Words, Regular and Context-Free Languages
作者：Sándor Horváth ; Masami Ito
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：1999
卷号：5
期号：9
页码：532-541
出版社：Graz University of Technology and Know-Center
摘要：
For any language L over an alphabet X, we define the root set, root(L) and the degree set, deg(L) as follows: (1) root(L) = where Q is the set of all primitive words over X, (2) deg(L) = . We deal with various decidability problems related to root and degree sets.