Author of the publication

On the Complexities of Linear LL(1) and LR(1) Grammars.

, and . FCT, volume 710 of Lecture Notes in Computer Science, page 299-308. Springer, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n)., and . Inf. Process. Lett., 25 (1): 13-15 (1987)A Note on the P-completeness of Deterministic One-way Stack Language.. J. Univers. Comput. Sci., 16 (5): 795-799 (2010)An Unambiguous Class Possessing a Complete Set.. STACS, volume 1200 of Lecture Notes in Computer Science, page 339-350. Springer, (1997)Complexity Theory and Formal Languages.. IMYCS, volume 381 of Lecture Notes in Computer Science, page 19-36. Springer, (1988)Context-Free Controlled ETOL Systems.. ICALP, volume 154 of Lecture Notes in Computer Science, page 723-733. Springer, (1983)Nondeterministic Logspace Reductions.. MFCS, volume 176 of Lecture Notes in Computer Science, page 378-388. Springer, (1984)StUSPACE(log n) <= DSPACE(log²n / log log n)., and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 193-202. Springer, (1996)Are There Formal Languages Complete for SymSPACE(log n)?. Foundations of Computer Science: Potential - Theory - Cognition, volume 1337 of Lecture Notes in Computer Science, page 125-134. Springer, (1997)Computational Calculus and Hardest Languages of Automata with Abstract Storages., and . FCT, volume 529 of Lecture Notes in Computer Science, page 200-209. Springer, (1991)Complexity and Structure in Formal Language Theory.. Fundam. Informaticae, 25 (3): 327-352 (1996)