Logspace and logtime leaf languages

Proceedings of the IEEE Annual Structure in Complexity Theory Conference

Volumn , Issue , 1994, Pages 242-254

  Jenner, Birgit ^a   McKenzie, Pierre ^a   Therien, Denis ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; CONTEXT FREE LANGUAGES; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING; TURING MACHINES;

COMPLEXITY CLASSES; LEAF LANGUAGES; LOGARITHMIC SPACE COMPUTATION; LOGARITHMIC TIME COMPUTATION;

FORMAL LANGUAGES;

EID: 0028607856     PISSN: 10636870     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)