当前位置:
X-MOL 学术
›
Lobachevskii J. Math.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On Undecidability of Concatenation Theory for One-Symbol Languages
Lobachevskii Journal of Mathematics Pub Date : 2020-07-13 , DOI: 10.1134/s1995080220020055 S. M. Dudakov
中文翻译:
一种符号语言的串联理论的不确定性
更新日期:2020-07-13
Lobachevskii Journal of Mathematics Pub Date : 2020-07-13 , DOI: 10.1134/s1995080220020055 S. M. Dudakov
Abstract
We investigate concatenation theories for some classes of one-symbol languages. These classes can be the class of all languages, the class of regular languages, or the class of finite languages. We prove that all such theories are undecidable. The last two theories are algorithmically equivalent to elementary arithmetic. The first is equivalent to second order arithmetic.中文翻译:
一种符号语言的串联理论的不确定性