保持正则性但不反射的编码
Regularity Preserving but not Reflecting Encodings
摘要:
编码,也就是从词到词的内射函数,已经在几个环境中被广泛研究。在可计算性理论中,编码的概念对于定义任意域上的可计算性以及比较计算模型的能力至关重要。在语言理论中,正则性保持函数一直受到关注。一个自然的问题出现在这些情况下是:是否有一个双射编码,使其图像功能保持语言的规律性,但其前图像功能没有?我们的主要结果肯定地回答了这个问题:对于每一个可数语言类C,存在一个双射编码f,使得对于C中的每一个语言L,它的像f[L]是正则的。我们构建这样的编码有几个值得注意的结果。首先,当计算模型与基于不需要可计算的编码的已知实现概念进行比较时,会出现异常:从这个意义上说,每个可计数决策模型都可以通过有限状态自动机实现,甚至通过双射编码。因此,确定性有限状态自动机将与图灵机决策器一样强大。第二个结果涉及通过数字表示和有限自动机识别自然数集合。如果一个自动机接受一个表示的语言,那么一组数字就被称为相对于一个表示是可识别的。我们的结果意味着,有一个数字表示,关于每个递归集是可识别的。
英文摘要:
Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defining computability on arbitrary domains, as well as for comparing the power of models of computation. In language theory much attention has been devoted to regularity preserving functions. A natural question arising in these contexts is: Is there a bijective encoding such that its image function preserves regularity of languages, but its pre-image function does not? Our main result answers this question in the affirmative: For every countable class C of languages there exists a bijective encoding f such that for every language L in C its image f[L] is regular. Our construction of such encodings has several noteworthy consequences. Firstly, anomalies arise when models of computation are compared with respect to a known concept of implementation that is based on encodings which are not required to be computable: Every countable decision model can be implemented, in this sense, by finite-state automata, even via bijective encodings. Hence deterministic finite-state automata would be equally powerful as Turing machine deciders. A second consequence concerns the recognizability of sets of natural numbers via number representations and finite automata. A set of numbers is said to be recognizable with respect to a representation if an automaton accepts the language of representations. Our result entails that there is one number representation with respect to which every recursive set is recognizable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。