Advertisement

On the complexities of linear LL(1) and LR(1) grammars

  • Markus Holzer
  • Klaus -Jörn Lange
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 710)

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 Ibarra, 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(logn)-complete membership problem. Moreover, they coincide with languages generated by linear grammars subject to LR(1) conditions.

Keywords

Turing Machine Regular Language Membership Problem Pushdown Automaton Input Head 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I, volume 11 of EATCS Monographs on Theoretical Computer Science. Springer, 1988.Google Scholar
  2. [2]
    D. A. M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC 1. Journal of Computer and System Sciences, 41:274–306, 1990.CrossRefGoogle Scholar
  3. [3]
    S. R. Buss. The boolean formula value problem is in ALOGTIME. In Proc. 19th Ann. ACM Symp. on Theory of Computing, pages 123–131, 1987.Google Scholar
  4. [4]
    J. H. Chang, O. H. Ibarra, T. Jiang, and B. Ravikumar. Some classes of languages in NC 1. Information and Computation, 90:86–106, 1991.CrossRefGoogle Scholar
  5. [5]
    S. A. Cook and P. McKenzie. Problems complete for deterministic logarithmic space. Journal of Algorithms, 8:385–394, 1987.CrossRefGoogle Scholar
  6. [6]
    S. Ginsburg and E. H. Spanier. Finite-turn pushdown automata. SIAM Journal on Computing, 4(3):429–453, 1966.Google Scholar
  7. [7]
    S. A. Greibach. An infinite hierarchy of context-free languages. Journal of the Association for Computing Machinery, 16:91–106, 1969.Google Scholar
  8. [8]
    M. A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, 1978.Google Scholar
  9. [9]
    J. E. Hopcroft and J. D. Ullman. Formal Languages and Their Relation to Automata. Addison-Wesley, 1968.Google Scholar
  10. [10]
    O. H. Ibarra, T. Jiang, and B. Ravikumar. Some subclasses of context-free languages in NC 1. Information Processing Letters, 29:111–117, October 1988.CrossRefGoogle Scholar
  11. [11]
    D. E. Knuth. On the translation of languages from left to right. Information and Control, 8:607–639, 1965CrossRefGoogle Scholar
  12. [12]
    A. Korenjak and J. Hopcroft. Simple deterministic languages. In IEEE Conference Record 7th Annual Symposium Switching Automata Theory, pages 36–46, 1966.Google Scholar
  13. [13]
    R. Kurki-Suonio. Notes on top-down languages. Bit, 9:225–238, 1969.Google Scholar
  14. [14]
    P. Lewis and R. Stearns. Syntax-directed transduction. Journal of the Association for Computing Machinery, 15:465–488, 1968.Google Scholar
  15. [15]
    M. Nasu and N. Honda. Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata. Information and Control, 15:250–273, 1969.CrossRefGoogle Scholar
  16. [16]
    I. H. Sudborough. A note on tape-bounded complexity classes and linear context-free languages. Journal of the Association for Computing Machinery, 22(4):499–500, October 1975.Google Scholar
  17. [17]
    I. H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery, 25:405–414, 1978.Google Scholar
  18. [18]
    K. Wagner and G. Wechsung. Computational Complexity. Mathematics and its applications (East Europeans series). VEB Deutscher Verlag der Wissenschaften, Berlin, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Markus Holzer
    • 1
  • Klaus -Jörn Lange
    • 1
  1. 1.Fakultät für InformatikTechnische Universität MünchenMünchenGermany

Personalised recommendations