成为共同布奇的代价是非线性的
The cost of being co-Buchi is nonlinear
摘要：
众所周知，也很容易看出，并不是每一个无限词上的非确定性Buchi自动机都能被非确定性co-Buchi自动机模拟。我们表明，在这种情况下，当这样的模拟是可能的，它所需要的状态的数量可以非线性增长。更准确地说，我们展示了一系列语言--正如我们所相信的那样，简单而优雅--它们证明了具有n个状态的非确定性Buchi自动机的存在，它可以由非确定性co-Buchi自动机模拟，但对于某个常数c，任何状态小于c*n^{7/6}的非确定性co-Buchi自动机都不能模拟。这改进了先前已知的最佳下界3（n-1）/2。
英文摘要：
It is well known, and easy to see, that not each nondeterministic Buchi automaton on infinite words can be simulated by a nondeterministic co-Buchi automaton. We show that in the cases when such a simulation is possible, the number of states needed for it can grow nonlinearly. More precisely, we show a sequence of - as we believe, simple and elegant - languages which witness the existence of a nondeterministic Buchi automaton with n states, which can be simulated by a nondeterministic co-Buchi automaton, but cannot be simulated by any nondeterministic co-Buchi automaton with less than c*n^{7/6} states for some constant c. This improves on the best previously known lower bound of 3(n-1)/2.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
