Skip to main content
SpringerLink
Log in

Complexity theory and formal languages

  • Chapter 1 Languages
  • Conference paper
  • First Online:
Machines, Languages, and Complexity (IMYCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 381))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho. Indexed grammars — an extension of context-free-grammars. J. Assoc. Comp. Mach., 15:647–671, 1968.

    Google Scholar 

  2. A. Aho. Nested stack automata. J. Assoc. Comp. Mach., 16:383–406, 1969.

    Google Scholar 

  3. J. Albert. Über indizierte und m-Block-indizierte Grammatiken. Dissertation, Universität Karlsruhe, 1976. (in German).

    Google Scholar 

  4. P. Asveld. Iterated context-independent rewriting. Ph.d. thesis, Technische Hogeschool Twente, 1978.

    Google Scholar 

  5. P. Asveld. Space-bounded complexity classes and iterated deterministic substitutions. Inform. and Control, 44:282–299, 1980.

    Google Scholar 

  6. P. Asveld. Time and space complexity of inside-out macro languages. Internat. J. Comput. Math., 10:3–14, 1981.

    Google Scholar 

  7. T. Baker, J. Gill, and R. Solovay. Relativizations of the P=? NP question. SIAM J. Comp., 4:431–442, 1975.

    Google Scholar 

  8. C. Beeri. Two-way nested stack automata are equivalent to two-way stack automata. J. Comp. System Sci., 10:317–339, 1975.

    Google Scholar 

  9. A. Borodin, S. Cook, P. Dymond, W. Ruzzo, and M. Tompa. Two applications of complementation via inductive counting. In Proc. of 3rd StCT, 1988.

    Google Scholar 

  10. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. J. Assoc. Comp. Mach., 28:114–133, 1981.

    Google Scholar 

  11. A. Chandra, L. Stockmeyer, and U. Vishkin. Complexity theory for unbounded FAN-IN parallelism. In Proc. of 23rd FOCS, pages 1–13, 1982.

    Google Scholar 

  12. S. Cook. Characterizations of pushdown machines in terms of time-bounded computers. J. Assoc. Comp. Mach., 18:4–18, 1971.

    Google Scholar 

  13. S. Cook. The complexity of theorem proving procedures. In Proc. of the 3rd Annual ACM Symp. on Theory of Computing, pages 151–158, 1971.

    Google Scholar 

  14. S. Cook. Deterministic cfl's are accepted simultaneously in polynomial time and log squared space. In Proc. on the 11th Annual ACM Symp. on Theory of Computing, pages 338–345, 1979.

    Google Scholar 

  15. S. Cook. A taxonomy of problems with fast parallel algorithms. Inform. and Control, 64:2–22, 1985.

    Google Scholar 

  16. P. Dymond and W. Ruzzo. Parallel rms with owned global memory and deterministic context-free language recognition. In Proc. of 13th ICALP, number 233 in LNCS, pages 95–104. Springer, 1987.

    Google Scholar 

  17. M.J. Fischer. Grammars with macro-like production. Ph.d. thesis, Harvard Univ., 1968.

    Google Scholar 

  18. P. Flajolet and J. Steyaert. Complexity of classes of languages and operators. Rap. de Recherche 92, IRIA Laboria, Nov. 1974.

    Google Scholar 

  19. S. Ginsburg, S. Greibach, and M. Harrison. One-way stack automata. JACM, 14:389–418, 1967.

    Google Scholar 

  20. S. Ginsburg, S. Greibach, and M. Harrison. Stack automata and compiling. J. Assoc. Comp. Mach., 14:172–201, 1967.

    Google Scholar 

  21. J.-W. Hong. On similarity and duality of computation. Inform. and Control, 62:109–128, 1984.

    Google Scholar 

  22. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading Mass., 1979.

    Google Scholar 

  23. H. Hunt. On the complexity of finite, pushdown, and stack automata. Math. Systems Theory, 10:33–52, 1976.

    Google Scholar 

  24. O. Ibarra. Characterizations of some tape and time complexity classes of turingmachines in terms of multihead and auxiliary stack automata. J. Comp. System Sci., 5:88–117, 1971.

    Google Scholar 

  25. O. Ibarra, S. Kim, and L. Rosier. Space and time efficient simulations and characterizations of some restricted classes of pdas. In Proc. of 11th ICALP, number 172 in LNCS, pages 247–259. Springer, 1984.

    Google Scholar 

  26. N. Immerman. Nondeterministic space is closed under complement. Technical Report 552, Yale University, 1987.

    Google Scholar 

  27. M. Jantzen. The power of synchronizing operations on strings. Theoret. Comput. Sci., 14:127–154, 1981.

    Google Scholar 

  28. B.J. Jenner and B. Kirsig. Characterizing the polynomial hierarchy by alternating auxiliary pushdown automata. In Proc. of 5th STACS, number 294 in LNCS, pages 118–125. Springer, 1988.

    Google Scholar 

  29. N. Jones. Space-bounded reducibility among combinatorial problems. J. Comp. System Sci., 11:68–85, 1975.

    Google Scholar 

  30. N. Jones and W. Laaser. Complete problems for deterministic polynomial time. Theoret. Comput. Sci., 3:105–117, 1977.

    Google Scholar 

  31. N. Jones and S. Skyum. Recognition of deterministic etol languages in logarithmic space. Inform. and Control, 35:177–181, 1977.

    Google Scholar 

  32. N. Jones and S. Skyum. Complexity of some problems concerning L systems. Math. Systems Theory, 13:29–43, 1979.

    Google Scholar 

  33. R. Ladner. The circuit value problem is log space complete for p. SIGACT NEWS, 7:18–20, 1975.

    Google Scholar 

  34. R. Ladner, R. Lipton, and L. Stockmeyer. Alternating pushdown and stack automata. SIAM J. Comp., 13:135–155, 1984.

    Google Scholar 

  35. R. Ladner and N. Lynch. Relativization of questions about log space computability. Math. Systems Theory, 10:19–32, 1976.

    Google Scholar 

  36. R. Ladner, L. Stockmeyer, and R. Lipton. Alternation bounded auxiliary pushdown automata. Inform. and Control, 62:93–108, 1984.

    Google Scholar 

  37. K.-J. Lange. Context-free controlled etol systems. In Proc. of 9th ICALP, number 154 in LNCS, pages 723–733. Springer, 1983.

    Google Scholar 

  38. K.-J. Lange. L systems and nlog-reductions. In G. Rozenberg and A. Salomaar, editors, The book of L, pages 245–252, Berlin, 1986. Springer.

    Google Scholar 

  39. K.-J. Lange. Nichtdeterministische Reduktionen und logarithmische Hierarchien. Technical Report 119, Fachbereich Informatik, Universität Hamburg, 1986. (in German).

    Google Scholar 

  40. K.-J. Lange. Two characterizations of the logarithmic alternation hierarchy. In Proc. of MFCS, number 233 in LNCS, pages 518–526. Springer, 1986.

    Google Scholar 

  41. K.-J. Lange. On the complexity of iterated insertion. In preparation, 1988.

    Google Scholar 

  42. K.-J. Lange, B. Jenner, and B. Kirsig. The logarithmic alternation hierarchy collapses':AΣL = AIIL′. In Proc. of 14th ICALP, number 267 in LNCS, pages 531–541. Springer, 1987.

    Google Scholar 

  43. K.-J. Lange and M. Schudy. A further link between formal languages and complexity theory. EATCS Bull., 33:67–71, 1987.

    Google Scholar 

  44. P. Lewis, R. Stearns, and J. Hartmanis. Memory bounds for recognition of context-free and context-sensitive languages. In Proc. 6th Annual IEEE Symp. on Switching Circuit Theory and Logical Design, pages 191–209, 1965.

    Google Scholar 

  45. A. Meyer and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Proc. of the 13th Annual IEEE Symposium on Switching and Automata Theory, pages 125–129, 1972.

    Google Scholar 

  46. B. Monien. About the deterministic simulation of nondeterministic (log n)-tape bounded turing machines. In 2-te TI Fachtagung Automatentheorie und Formale Sprachen, number 33 in LNCS, pages 118–126. Springer, 1975.

    Google Scholar 

  47. B. Monien and I. Sudborough. The interface between language theory and complexity theory. In R. Book, editor, Formal Languages — Perspectives and Open Problems, pages 287–324, New York, 1980. Academic Press.

    Google Scholar 

  48. N. Pippinger. On simultaneous resource bounds. In Proc. of 20th FOCS, pages 307–311, 1979.

    Google Scholar 

  49. G. Rozenberg. On a family of acceptors for some classes of developmental languages. Internat. J. Comput. Math., 4:199–228, 1974.

    Google Scholar 

  50. G. Rozenberg and A. Salomaar. The Mathematical Theory of L Systems. Academic Press, New York, 1980.

    Google Scholar 

  51. W. Ruzzo. Tree-size bounded alternation. J. Comp. System Sci., 21:218–235, 1980.

    Google Scholar 

  52. W. Ruzzo. On uniform circuit complexity. J. Comp. System Sci., 22:365–338, 1981.

    Google Scholar 

  53. W. Ruzzo, J. Simon, and M. Tompa. Space — bounded hierarchies and probabilistic computations. J. Comp. System Sci., 28:216–230, 1984.

    Google Scholar 

  54. W. Rytter. Parallel time. o(log n) recognition of unambiguous context-free languages. Inform. and Control, 73:75–86, 1987.

    Google Scholar 

  55. W. Savitch. Relationships between nondeterministic and deterministic tape complexities. J. Comp. System Sci., 4:177–192, 1970.

    Google Scholar 

  56. U. Schöning and K. Wagner. Collapsing oracle hierarchies, census functions and logarithmically many queries. In Proc. of 5th STACS, number 294 in LNCS, pages 91–97. Springer, 1988.

    Google Scholar 

  57. R. Sczelepcsényi. The method of forcing for nondeterministic automata. EATCS-Bull., 33:96–100, 1987.

    Google Scholar 

  58. E. Shamir and C. Beeri. Checking stacks and context-free programmed grammars accept p-complete languages. In Proc. of 2nd ICALP, number 14 in LNCS, pages 277–283. Springer, 1974.

    Google Scholar 

  59. L. Stockmeyer and A. Meyer. Word problems requiring exponential time: preliminary report. In Proc. of the 5th Annual ACM Symposium on Theory of Computing, pages 1–9, 1973.

    Google Scholar 

  60. L. Stockmeyer and C. Vishkin. Simulation of random access machines by circuits. SIAM J. Comp., 13:409–422, 1984.

    Google Scholar 

  61. I. Sudborough. A note on tape-bounded complexity classes and linear context-free languages. J. Assoc. Comp. Mach., 22:499–500, 1975.

    Google Scholar 

  62. I. Sudborough. The complexity of the membership problem for some extensions of context-free languages. Internat. J. Comput. Math. SECT A, 6:191–215, 1977.

    Google Scholar 

  63. I. Sudborough. On the tape complexity of deterministic context-free languages. J. Assoc. Comp. Mach., 25:405–414, 1978.

    Google Scholar 

  64. J. van Leeuwen. The membership question for etol languages is polynomially complete. Information Processing Letters, 3:138–143, 1975.

    Google Scholar 

  65. J. van Leeuwen. Variations of a new machine model. In Proc. of 17th FOCS, pages 228–235, 1976.

    Google Scholar 

  66. H. Venkateswaran. Properties that characterize logcfl. In Proc. of 19th STOC, pages 141–150, 1987.

    Google Scholar 

  67. K. Wagner and G. Wechsung. Computational complexity. VEB Deutscher Verlag der Wissenschaften, Berlin, 1986.

    Google Scholar 

  68. M. Warmuth and D. Haussler. On the complexity of iterated shuffle. J. Comp. System Sci., 28:345–358, 1984.

    Google Scholar 

  69. C. Wrathall. Complete sets of the polynomial hierarchie. Theoret. Comput. Sci., 3:23–33, 1976.

    Google Scholar 

  70. D. Young. Recognition and parsing of context-free languages in time n 3. Inform. and Control, 10:189–208, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Arcisstr. 21, D-8000, München 2

    Klaus-Jörn Lange

Authors
  1. Klaus-Jörn Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Dassow J. Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lange, KJ. (1989). Complexity theory and formal languages. In: Dassow, J., Kelemen, J. (eds) Machines, Languages, and Complexity. IMYCS 1988. Lecture Notes in Computer Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015925

Download citation

  • DOI: https://doi.org/10.1007/BFb0015925

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51516-6

  • Online ISBN: 978-3-540-48203-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation