Complexity and structure in formal language theory

Fundamenta Informaticae

Volumn 25, Issue 3-4, 1996, Pages 327-352

  Lange, Klaus Jörn ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007151233     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-253408     Document Type: Article

References (74)

1. A. Aho. Nested stack automata. J. Assoc. Comp. Mach., 16:383-406, 1969.
2. P. Asveld. Time and space complexity of inside-out macro languages. Internat. J. Comput. Math., 10:3-14, 1981.
3. J. Balcácar, J. Diáz, and J. Gabárro. Structural Complexity Theory I. Springer, 1988.
4. 1. J. Comp. System Sci., 38:150-164, 1989.
5. 1. In Proc. 3rd Structure in Complexity Theory, pages 47-59. IEEE, 1988.
6. J. Berstel. Transductions and Context-Free Languages. Teubner Verlag, Stuttgart, 1979.
7. A. Blass and Y. Gurevich. On the unique satisfiability problem. Inform. and Control, 55:80-88, 1982.
8. R. Book and S. Greibach. Quasi-realtime languages. Math. System Theory, 4:97-111, 1970.
9. R. Book, S. Greibach, and B. Wegbreit. Time- and tape-bounded turing acceptors and AFLs. J. Comp. System Sci., 4:606-621, 1970.
10. A. Borodin. On relating time and space to size and depth. SIAM Journal on Computing, 6(4):733-744, 1977.
11. G. Buntrock, C. Damm, U. Hertrampf, and C. Meinel. Structure and importance of logspace-MOD-classes. In Proc. 7th Symposium Theoretical Aspects of Computer Science, number 480 in LNCS, pages 360-371. Springer, 1991.
12. G. Buntrock, B. Jenner, K.-J. Lange, and P. Rossmanith. Unambiguity and fewness for logarithmic space. In Proc. of the 8th Conference on Fundamentals of Computation Theory, number 529 in LNCS, pages 168-179, 1991.
13. S. Cook. Characterizations of pushdown machines in terms of time-bounded computers. J. Assoc. Comp. Mach., 18:4-18, 1971.
14. S. Cook. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space. In Proc. of the 11th Annual ACM Symp. on Theory of Computing, pages 338-345, 1979.
15. E. Dahlhaus and M. K. Warmuth. Membership for growing context-sensitive grammars is polynomial. J. Comp. System Sci., 33:456-472, 1986.
16. C. Damm, M. Holzer, and K.-J. Lange. The parallel complexity of iterated morphisms and the arithmetic of small numbers. In Proc. 17th Symposium on Mathematical Foundations of Computer Science, number 629 in LNCS, pages 227-235. Springer, 1992.
17. 0. In Proc. Developments in Language Theory, 1993. to appear.
18. J. Dassow and K.-J. Lange. Complexity of automata with abstract storages. In Proc. of the 8th Conference on Fundamentals of Computation Theory, number 529 in LNCS, pages 200-209. Springer, 1991.
19. P. Dymond and W. Ruzzo. Parallel RAMs with owned global memory and deterministic context-free language recognition. In Proc. of 13th International Colloquium on Automata, Languages and Programming, number 226 in LNCS, pages 95-104. Springer, 1986.
20. J. Engelfriet. Iterated pushdown automata and complexity classes. In Proc. on the 15th Annual ACM Symp. on Theory of Computing, pages 365-373, 1983.
21. M.J. Fischer. Grammars with macro-like production. Ph.d. thesis, Harvard Univ., 1968.
22. P. Flajolet and J. Steyaert. Complexity of classes of languages and operators. Rap. de Recherche 92, IRIA Laboria, Nov. 1974.
23. S. Fortune and J. Wyllie. Parallelism in random access machines. In Proc. of the 10th Annual ACM Symposium on Theory of Computing, pages 114-118, 1978.
24. M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory, 17:13-27, 1984.
25. S. Ginsburg. Formal Languages. North-Holland, Amsterdam, 1975.
26. S. Ginsburg, S. Greibach, and M. Harrison. One-way stack automata. J. Assoc. Comp. Mach., 14:389-418, 1967.
27. L. M. Goldschlager. A unified approach to models of synchronous parallel computation. In Proc. of the 10th Annual ACM Symposium on Theory of Computing, pages 89-94, 1978.
28. S. Greibach. The hardest context-free language. SIAM J. Comp., 2:304-310, 1973.
29. M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading Mass., 1978.
30. J. Hartmanis and S. Mahaney. Languages simultaneously complete for one-way and two-way log-tape automata. SIAM J. Comp., 10:383-390, 1981.
31. M. Holzer and K.-J. Lange. On the complexity of operations on formal languages. In preparation.
32. M. Holzer and K.-J. Lange. On the complexities of linear LL(1) and LR(1) grammars. In Proc. of the 9th FCT, number 710 in LNCS, pages 299-308. Springer Verlag, 1993.
33. J. Hopcroft and J. Ullman. Introduction to Automata Theory, Language, and Computation. Addison-Wesley, Reading Mass., 1979.
34. O. Ibarra. Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. J. Comp. System Sci., 5:88-117, 1971.
35. 1. Information Processing Letters, 29:112-117, 1988.
36. D.S. Johnson. A catalog of complexity classes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A, pages 67-161. Elsevier, Amsterdam, 1990.
37. N. Jones and S. Skyum. Recognition of deterministic ETOL languages in logarithmic space. Inform. and Control, 35:177-181, 1977.
38. N. Jones and S. Skyum. Complexity of some problems concerning L systems. Math. Systems Theory, 13:29-43, 1979.
39. M. Karchmer and A. Wigderson. On span programs. In Proc. of the 8th IEEE Structure in Complexity Theory Conference, pages 102-111, 1993.
40. R. Ladner and N. Lynch. Relativization of questions about log space computability. Math. Systems Theory, 10:19-32, 1976.
41. K.-J. Lange. Context-free controlled ETOL systems. In Proc. of 9th International Colloquium on Automata, Languages and Programming, number 154 in LNCS, pages 723-733. Springer, 1983.
42. K.-J. Lange. Decompositions of nondeterministic reductions. Theoret. Comput. Sci., 58:175-181, 1988.
43. K.-J. Lange. Unambiguity of circuits. In Proc. of the 5th IEEE Structure in Complexity Conference, pages 130-137, 1990.
44. K.-J. Lange. Complexity and structure in formal language theory. In Proc. of the 8th IEEE Structure in Complexity Conference, pages 224-238, 1993.
45. K.-J. Lange. A note on the P-completeness of deterministic one-way stack languages. In preperation, 1993.
46. K.-J. Lange. Unambiguity of circuits. Theoret. Comput. Sci., 107:77-94, 1993.
47. K.-J. Lange and P. Rossmanith. Characterizing unambiguous augmented pushdown automata by circuits. In Proc. of 15th Symposium on Mathematical Foundations of Computer Science, number 452 in LNCS, pages 399-406. Springer, 1990.
48. K.-J. Lange and M. Schudy. The complexity of the emptiness problem for EOL systems. In G. Rozenberg and A. Salomaa, editors, Lindenmayer Systems, pages 167-175, Berlin, 1992. Springer.
49. P. Lewis and C.H. Papadimitriou. Symmetric space-bounded computation. Theoret. Comput. Sci., 19:161-187, 1982.
50. 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.
51. B. Monien. About the deterministic simulation of nondeterministic (log n)-tape bounded turing machines. In 2-te GI Fachtagung Automatentheorie und Formale Sprachen, number 33 in LNCS, pages 118-126. Springer, 1975.
52. R. Niedermeier and P. Rossmanith. Unambiguous simulations of auxiliary pushdown automata and circuits. Inform. and Control, 1993. (to appear).
53. I. Niepel. Logarithmisch platzbeschränkte Kompleitätsklassen - Charakterisierung und offene Fragen. Diplomarbeit, Universität Hamburg, 1987. (in German).
54. I. Niepel and P. Rossmanith. Uniform circuits and exclusive read PRAMs. In Proc. of the 11th FST&TCS, number 560 in LNCS, pages 307-318. Springer Verlag, 1990.
55. N. Nisan. RL ⊆ SC. In Proc. of the 24th Annual ACM Symposium on Theory of Computing, pages 619-623, 1992.
56. 1.5 n) space. In Proc. of 34th Annual IEEE Symposium on Foundations of Computer Science, pages 24-29, 1992.
57. K. Reinhardt. Counting and empty alternating pushdown automata. In Proc. 7th International Meeting of Young Computer Scientists, pages 198-207, Smolenice Castle, Tschechoslowakei, 1992.
58. P. Rossmanith. The owner concept for PRAMs. In Proc. of the 8th STACS, number 480 in LNCS, pages 172-183. Springer, 1991.
59. W. C. Rounds. Complexity of recognition in intermediate-level languages. In Proc. of the 14th Annual IEEE Symposium on Switching and Automata Theory, pages 145-158, 1973.
60. G. Rozenberg and A. Salomaa. The Mathematical Theory of L Systems. Academic Press, New York, 1980.
61. W. Ruzzo. Tree-size bounded alternation. J. Comp. System Sci., 21:218-235, 1980.
62. W. Ruzzo. On uniform circuit complexity. J. Comp. System Sci., 22:365-338, 1981.
63. W. Ruzzo, J. Simon, and M. Tompa. Space - bounded hierarchies and probabilistic computations. J. Comp. System Sci., 28:216-230, 1984.
64. W. Rytter. Parallel time O(log n) recognition of unambiguous context-free languages. Inform. and Control, 73:75-86, 1987.
65. 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.
66. L. Stockmeyer and C. Vishkin. Simulation of random access machines by circuits. SIAM J. Comp., 13:409-422, 1984.
67. I. Sudborough. A note on tape-bounded complexity classes and linear context-free languages. J. Assoc. Comp. Mach., 22:499-500, 1975.
68. I. Sudborough. Oa tape-bounded complexity classes and multi-head finite automata. J. Comp. System Sci., 10:62-76, 1975.
69. 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.
70. I. Sudborough. On the tape complexity of deterministic context-free languages. J. Assoc. Comp. Mach., 25:405-414, 1978.
71. J. van Leeuwen. The membership question for ETOL languages is polynomially complete. Information Processing Letters, 3:138-143, 1975.
72. H. Venkateswaran. Properties that characterize LOGCFL. In Proc. of the 19th Annual ACM Symp. on Theory of Computing, pages 141-150, 1987.
73. T. Verbeek. Time-space trade-offs for general recursion. In Proc. of 22th Annual IEEE Symposium on Foundations of Computer Science, pages 228-234, 1981.
74. 3. Inform. and Control, 10:189-208, 1967.