Abstract:An acceptor for a language L is an algorithm that accepts every input in L and does not stop on every input not in L. An acceptor Opt for a language L is called optimal if for every acceptor A for this language there exists polynomial p A such that for every x ∈ L, the running time time Opt (x) of Opt on x is bounded by p A (time A (x) + |x|) for every x ∈ L. (Note that the comparison of the running time is done pointwise, i.e., for every word of the language.)The existence of optimal acceptors is an important… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.