On the Complexities of Linear LL(1) and LR(1) Grammars
暂无分享,去创建一个
[1] Stephen A. Cook,et al. Problems Complete for Deterministic Logarithmic Space , 1987, J. Algorithms.
[2] Neil Immerman,et al. On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..
[3] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[4] Tao Jiang,et al. Some Subclasses of Context-Free Languages In NC1 , 1988, Inf. Process. Lett..
[5] Namio Honda,et al. Mappings Induced by PGSM-Mappings and Some Recursively Unsolvable Problems of Finite Probabilistic Automata , 1969, Inf. Control..
[6] S. Ginsburg,et al. Finite-Turn Pushdown Automata , 1966 .
[7] Tao Jiang,et al. Some Classes of Languages in NC¹ , 1991, Inf. Comput..
[8] Richard Edwin Stearns,et al. Syntax-Directed Transduction , 1966, JACM.
[9] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .
[10] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.
[11] John E. Hopcroft,et al. Simple Deterministic Languages , 1966, SWAT.
[12] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..
[13] N. Immerman,et al. On uniformity within NC 1 . , 1988 .
[14] Samuel R. Buss,et al. The Boolean formula value problem is in ALOGTIME , 1987, STOC.
[15] Sheila A. Greibach,et al. An Infinite Hierarchy of Context-Free Languages , 1969, JACM.
[16] Notes on top-down languages , 1969 .
[17] Ivan Hal Sudborough,et al. A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages , 1975, JACM.
[18] José L. Balcázar,et al. Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.