L. Budach (Ed.), Fundamentals of Computing Theory, FCT'85 Conf., Vol. 199, Springer, Berlin (1985), pp. 1-7. Lecture Notes in Computer Science.
Szepietowski A. Remarks on languages acceptable in log log n space // Information Processing Letters. 1988. Vol. 27. No. 4. pp. 201-203. ... Szepietowski A.
Remarks on languages acceptable in log log n space. Back. Remarks on languages acceptable in log log n space. Authors: Andrzej Szepietowski. Metrics. Record ID ...
Oct 11, 2016 · If we do this, we never check the MSB of each representation, so for example the string 10#11#10#11 would be accepted since it never checks m=2.
May 31, 2005 · 'Input-driven languages are recognized in log n space' published in 'Foundations of Computation Theory'
Thus any language that is reducible to UOptL[log n] is in the complexity class. SPL. This contrasts with the equivalence OptL[log n] = FLNL[log n]. We also show ...
Since p is fixed, it follows that an entire assignment can also be stored in O(log n) space. ... Every Indian parallel language is in NSPACE(log n).
ATIME(T(n)) is the class of languages accepted in time O(T(n)) by an ATM. ASPACE(S(n)) is the class of languages accepted in space O(S(n)) by an ATM. For ...
NL (Nondeterministic Logarithmic-space) is the complexity class containing decision problems that can be solved by a nondeterministic Turing machine using a ...
The power of deterministic and nondeterministic input driven automata is the same and these automata can recognize e.g. the parenthesis languages and the ...