弱不可逆和强不可逆正则语言
Weakly and Strongly Irreversible Regular Languages
摘要:
有限自动机的计算可以逆转,在任何一点上,通过知道最后k个符号从输入中读取,对于一个固定的k,被认为是。这些设备和它们接受的语言分别被称为k-可逆自动机和k-可逆语言。已知存在k-可逆语言,但不存在(k-1)-可逆语言,对于每个k>1。这给出了弱不可逆语言的无限层次,即,对于某些k是k可逆的语言。对于每个固定的k,得到了刻画k-可逆语言类和弱不可逆语言类的条件。根据这些条件,给出有限自动机的过程决定所接受的语言是弱的还是强的(即,不弱)不可逆的。此外,一个建设,允许任何有限自动机,这是不k-可逆的,但它接受一个k-可逆的语言,到一个等价的k-可逆有限自动机,提出。
英文摘要:
Finite automata whose computations can be reversed, at any point, by knowing the last k symbols read from the input, for a fixed k, are considered. These devices and their accepted languages are called k-reversible automata and k-reversible languages, respectively. The existence of k-reversible languages which are not (k-1)-reversible is known, for each k>1. This gives an infinite hierarchy of weakly irreversible languages, i.e., languages which are k-reversible for some k. Conditions characterizing the class of k-reversible languages, for each fixed k, and the class of weakly irreversible languages are obtained. From these conditions, a procedure that given a finite automaton decides if the accepted language is weakly or strongly (i.e., not weakly) irreversible is described. Furthermore, a construction which allows to transform any finite automaton which is not k-reversible, but which accepts a k-reversible language, into an equivalent k-reversible finite automaton, is presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。