N. D. Jones and S. Skyum. Recognition of deterministic ET0L languages in logarithmic space. Information and Computation, 35:177-181, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Complexity of Iterated Morphisms and the.. - Damm, Holzer, Lange (1992) (1 citation) (Correct)
....complexity of the membership problem for these languages is in most cases well determined, as it is for contextfree languages. This can be seen by the following completeness results 1 , since the class of T0L languages is NP complete [15] the class of DT0L languages is NSPACE(logn) complete [12], and the class of 0L languages is LOGCFL complete [18] For the case of D0L systems, i.e. of one iterated homomorphism, no such precise complexity bounds are known. Sudborough exhibited in [18] a logarithmically space bounded algorithm for the D0L membership problem. But at present there is no ....
N. D. Jones and S. Skyum. Recognition of deterministic ET0L languages in logarithmic space. Information and Computation, 35:177--181, 1977.
Deterministic 0L Languages are of Very - Low Complexity Is Self-citation (Deterministic) (Correct)
No context found.
N. D. Jones and S. Skyum. Recognition of deterministic ET0L languages in logarithmic space. Information and Computation, 35:177-181, 1977.
Deterministic 0L Languages are of Very Low.. - Damm, Holzer, Lange, .. (Correct)
No context found.
N. D. Jones and S. Skyum. Recognition of deterministic ET0L languages in logarithmic space. Information and Computation, 35:177-181, 1977.
Deterministic 0L Languages are of Very Low.. - Damm, Holzer, Lange, .. (Correct)
No context found.
N. D. Jones and S. Skyum. Recognition of deterministic ET0L languages in logarithmic space. Information and Computation, 35:177--181, 1977.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC