关于1NFA的2DFA模拟：二次下界方法的新局限性
Unrestricted 2DFA simulation of 1NFAs: A Quadratic Limitation to a New Lower Bound
浏览论文内容
中文总结 AI 辅助
本文证明作者近期提出的证明单向非确定性有限自动机转换为双向确定性有限自动机状态数二次下界的新方法，与Chrobak方法一样，无法得到严格大于二次的下界。
中文摘要 AI 辅助
本文作者近期的一项结果确立了在最坏情况下，将单向非确定性有限自动机转换为双向确定性有限自动机时状态数增加的二次下界。尽管这一结果仅与Chrobak先前已知的二次下界持平，但它采用了不同的证明方法。我们证明，与Chrobak的方法类似，这种新方法同样无法给出任何严格大于二次的下界。
英文摘要
A recent result by the present authors established a quadratic lower bound, in the worst case, for the increase in the number of states when a one-way nondeterministic finite automaton is converted to a two-way deterministic finite automaton. Although this simply matched a well-known pre-existing quadratic lower bound by Chrobak, it used a distinct proof method. We show that, much like Chrobak's, this new method is also unable to deliver any lower bound strictly greater than quadratic.
