论文信息 - Input-Driven Languages are in log n Depth - 字舞流文

Input-Driven Languages are in log n Depth

Patrick W. Dymond

[1] Samuel R. Buss,et al. The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[2] Burchard von Braunmühl,et al. Input-Driven Languages are Recognized in log n Space , 1983, FCT.

[3] Patrick W. Dymond,et al. Speedups of Deterministic Machines by Synchronous Parallel Machines , 1985, J. Comput. Syst. Sci..

[4] Kurt Mehlhorn,et al. Bracket-Languages are Recognizable in Logarithmic Space , 1976, Inf. Process. Lett..

[5] Martin Tompa,et al. A New Pebble Game that Characterizes Parallel Complexity Classes , 1986, FOCS.

[6] Wojciech Rytter. An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages , 1986, Inf. Process. Lett..

[7] Nancy A. Lynch,et al. Log Space Recognition and Translation of Parenthesis Languages , 1977, JACM.

[8] Richard J. Lipton,et al. Word Problems Solvable in Logspace , 1977, JACM.

[9] Walter L. Ruzzo. On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..