arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.3039math.LOcs.LOmath.GR
收藏

确定和非确定异步自动机识别谓词的封闭性

Closure properties of predicates recognized by deterministic and non-deterministic asynchronous automata

Maria Monks

摘要:

设A是一个有限字母表,包含在(A*)^n中的L是A上的一个n元语言.我们说L是正则的,如果它是同步n带有限状态自动机接受的语言,如果它是异步n带自动机接受的语言,那么它是准正则的,如果它是非确定性异步n带自动机接受的语言,那么它是弱正则的。我们研究了在一阶逻辑下正则语言、拟正则语言和弱正则语言类的封闭性,并将这些结果应用于自动群论中的一个开放判定性问题。

英文摘要:

Let A be a finite alphabet and let L contained in (A*)^n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an asynchronous n-tape automaton, and it is weakly regular if it is accepted by a non-deterministic asynchronous n-tape automaton. We investigate the closure properties of the classes of regular, quasi-regular, and weakly regular languages under first-order logic, and apply these observations to an open decidability problem in automatic group theory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑