AbstractTranslational lemmas are stated in a general framework and then applied to specific complexity classes. Necessary and sufficient conditions are given for every set accepted by a Turing acceptor which operates in linear or polynomial time to be accepted by a Turing acceptor which operates in space (log n)j for some j ⩾ 1
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
We investigate the effect on the space complexity when a language family K is extended by means of i...
An intriguing question is whether (log n) ~ space is enough to recognize the class 9 ~ of languages...
AbstractTranslational lemmas are stated in a general framework and then applied to specific complexi...
AbstractLog space reducibility allows a meaningful study of complexity and completeness for the clas...
We investigate the correspondence between the time and space recognition complexity of languages; fo...
Each algorithm recognizing any generator of the class of context-free languages requires space Omega...
A condition on a class of languages is developed. This condition is such that every tally language i...
Complexity classes defined by time-bounded and space-bounded Turing acceptors are studied in order t...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
The complexity measure under consideration is SPACE x REVERSALS for Turing machines that are able to...
Refined Turing machine space complexity classes are defined by limiting all three of the resources s...
The following statements are shown to be equivalent:(i)Every language accepted by a nondeterministic...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
We investigate the effect on the space complexity when a language family K is extended by means of i...
An intriguing question is whether (log n) ~ space is enough to recognize the class 9 ~ of languages...
AbstractTranslational lemmas are stated in a general framework and then applied to specific complexi...
AbstractLog space reducibility allows a meaningful study of complexity and completeness for the clas...
We investigate the correspondence between the time and space recognition complexity of languages; fo...
Each algorithm recognizing any generator of the class of context-free languages requires space Omega...
A condition on a class of languages is developed. This condition is such that every tally language i...
Complexity classes defined by time-bounded and space-bounded Turing acceptors are studied in order t...
We investigate the following: (1) the relationship between the classes of languages accepted by det...
AbstractThere is a single set that is complete for a variety of nondeterministic time complexity cla...
We investigate the relationship between the classes of languages accepted by deterministic and nonde...
The complexity measure under consideration is SPACE x REVERSALS for Turing machines that are able to...
Refined Turing machine space complexity classes are defined by limiting all three of the resources s...
The following statements are shown to be equivalent:(i)Every language accepted by a nondeterministic...
AbstractFor classes of languages accepted in polynomial time by multicounter machines, various trade...
We investigate the effect on the space complexity when a language family K is extended by means of i...
An intriguing question is whether (log n) ~ space is enough to recognize the class 9 ~ of languages...
DOI
Add to ORKG