Abstract
Several notions of deterministic linear languages are considered and compared with respect to their complexities and to the families of formal languages they generate. We exhibit close relationships between simple linear languages and the deterministic linear languages both according to Nasu and Honda and to lbarra, Jiang, and Ravikumar. Deterministic linear languages turn out to be special cases of languages generated by linear grammars restricted to LL(1) conditions, which have a membership problem solvable in NC1. In contrast to that, deterministic linear languages defined via automata models turn out to have a DSPACE(log n)- complete membership problem. Moreover, they coincide with languages generated by linear grammars subject to LR(l) conditions.
Cite
CITATION STYLE
Holzer, M., & Lunge, K. J. (1993). On the complexities of linear LL(1) LR(1) grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 710 LNCS, pp. 299–308). Springer Verlag. https://doi.org/10.1007/3-540-57163-9_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
