论文信息 - Complexity of Some Problems Concerning L Systems - 字舞流文

Complexity of Some Problems Concerning L Systems

Sven Skyum | Neil D. Jones | Sven Skyum | N. Jones

[1] I. H. Sudborough. The complexity of the membership problem for some extensions of context-free languagest† , 1977 .

[2] Kurt Mehlhorn,et al. Lower Bounds for the Space Complexity of Context-Free Recognition , 1976, International Colloquium on Automata, Languages and Programming.

[3] Jan van Leeuwen,et al. The Tape-Complexity of Context-Independent Developmental Languages , 1975, J. Comput. Syst. Sci..

[4] Ivan Hal Sudborough,et al. A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages , 1975, JACM.

[5] Jan van Leeuwen,et al. The Membership Question for ET0L-Languages is Polynomially Complete , 1975, Inf. Process. Lett..

[6] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[7] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[8] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[9] Daniel H. Younger,et al. Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..