arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.00502cs.FLcs.LO
收藏

正则文法生成的非确定性有限自动机的公理化

Axiomatizing NFAs Generated by Regular Grammars

Roberto Gorrieri

AI总结:

本文引入正则文法生成的非确定性有限自动机(GFA),提出进程代数语义并证明可表示性定理,进而用7条公理加2条条件公理给出语言等价性的简洁公理化。

摘要:

本文引入了一类通过正则文法生成的非确定性有限自动机子类(简称GFA)。提出了一个进程代数,其语义将一个项映射到一个GFA。我们证明了一个可表示性定理:对于每个GFA $N$,存在一个进程代数项 $p$,使得其语义是一个与 $N$ 同构的GFA。此外,我们给出了语言等价性的简洁公理化:两个GFA $N_1$ 和 $N_2$ 识别相同的正则语言,当且仅当相关联的项 $p_1$ 和 $p_2$ 可以仅通过一组公理(包括7条公理加2条条件公理)进行等式推导。

英文摘要:

A subclass of nondeterministic Finite Automata generated by means of regular Grammars (GFAs, for short) is introduced. A process algebra is proposed, whose semantics maps a term to a GFA. We prove a representability theorem: for each GFA $N$, there exists a process algebraic term $p$ such that its semantics is a GFA isomorphic to $N$. Moreover, we provide a concise axiomatization of language equivalence: two GFAs $N_1$ and $N_2$ recognize the same regular language if and only if the associated terms $p_1$ and $p_2$, respectively, can be equated by means of a set of axioms, comprising 7 axioms plus 2 conditional axioms, only.

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

↑