Moreover, using our concept of assigning meaning to the states of 2DFAs we show that there is no exponential gap between general 2NFAs and 2DFAs on inputs of a polynomial length of the complete language of Sakoda and Sipser. 展开 关键词: Nondeterminism two-way finite automata state ...
We show that at least one of the following three claims must be true: Another surprising consequence of P = NP would be that time-bounded Kolmogorov complexity for any polynomial bound can be computed by deterministic algorithms in polynomial time....
Cai, L., Chen, J.: On the Amount of Nondeterminism and the Power of Verifying. SIAM J. Computing 26(3), 733–750 (1997) MATH MathSciNetCai, L., Chen, J.: On the amount of nondeterminism and the power of verifying. SIAM J. Comput. 26 , 733–750 (1997) MATH MathSciNet...
Our results include polynomial-time algorithms to (i) recognize and prefix-sort Wheeler finite automata (even admitting some limited amount of nondeterminism), (ii) minimize Wheeler DFAs, and (iii) compute the minimum Wheeler DFA ... J Alanko,D'Agostino, Giovanna,A Policriti,... 被引量: ...
2NFA question is so hard. The hardness of this question is also emphasized by the direct connection to the DLOG vs. NLOG problem. Berman and Lingas showed [1] that if DLOG equals NLOG, then there exists a polynomial p such that, for every n-state two-way nondeterministic automaton A,...
摘要: This article deals with the question whether nondeterminism is morepowerful than determinism and tries to give more arguments for the positiveanswer and also outlines why solving this problem is so hard. 关键词: MSC68Q0168Q1068Q3068Q15 KeywordsKolmogorov complexityComputational complexityPNPNonde...
A superpolynomial gap between 2NFAs and 2DFAs on words of polynomial length in the parameter of a complete language of Sipser and Sakoda for the 2DFA vs. 2NFAs problem would imply that DLOG is a proper subset of NLOG. The first goal of this paper is first to survey the attempts to ...
A superpolynomial gap between 2NFAs and 2DFAs on words of polynomial length in the parameter of a complete language of Sipser and Sakoda for the 2DFA vs. 2NFAs problem would imply that DLOG is a proper subset of NLOG. The first goal of this paper is first to survey the attempts to ...
A superpolynomial gap between 2NFAs and 2DFAs on words of polynomial length in the parameter of a complete language of Sipser and Sakoda for the 2DFA vs. 2NFAs problem would imply that DLOG is a proper subset of NLOG.The goal of this paper is first to survey the attempts to solve ...
This is established by two theorems: one using a co-nondeterministic variant of cross-composition and one by a polynomial parameter transformation from RAMSEY. Additionally, we show how to use improvement versions of NP-hard problems as source problems for lower bounds, without requiring their NP-...