arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.05061cs.FL
收藏

级联自动机状态可达性的一种新方法

A New Technique for Reachability of States in Concatenation Automata

Sylvie Davies

摘要:

我们提出了一种新的技术,证明了在确定性有限自动机表示两种语言的连接状态的可达性。这种证明是建立两种语言连接的状态复杂度的必要步骤,因此也是建立连接作为一种操作的状态复杂度的必要步骤。通常情况下,ad-hoc归纳参数用于显示特定状态在级联自动机中是可达的。我们证明了一些结果,似乎抓住了许多这些归纳论点的本质。利用这些结果,级联自动机的可达性证明往往可以做得更简单,而不直接使用归纳法。

英文摘要:

We present a new technique for demonstrating the reachability of states in deterministic finite automata representing the concatenation of two languages. Such demonstrations are a necessary step in establishing the state complexity of the concatenation of two languages, and thus in establishing the state complexity of concatenation as an operation. Typically, ad-hoc induction arguments are used to show particular states are reachable in concatenation automata. We prove some results that seem to capture the essence of many of these induction arguments. Using these results, reachability proofs in concatenation automata can often be done more simply and without using induction directly.

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

↑