论文信息 - Time Complexity of Loop-Free Two-Way Pushdown Automata - 字舞流文

Time Complexity of Loop-Free Two-Way Pushdown Automata

Wojciech Rytter | W. Rytter

[1] Wojciech Rytter,et al. A Note on Two-Way Nondeterministic Pushdown Automata , 1982, Inf. Process. Lett..

[2] Wojciech Rytter,et al. The Dynamic Simulation of Recursive and Stack Manipulation Programs , 1981, Inf. Process. Lett..

[3] Wojciech Rytter,et al. An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads , 1981, Inf. Process. Lett..

[4] Richard S. Bird,et al. Tabulation Techniques for Recursive Programs , 1980, CSUR.

[5] Richard S. Bird,et al. Improving programs by the introduction of recursion , 1977, Commun. ACM.

[6] Leslie G. Valiant,et al. General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[7] Alfred V. Aho,et al. Time and Tape Complexity of Pushdown Automaton Languages , 1968, Inf. Control..