On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's

In this paper we present some space/time efficient Turing machine algorithms for recognizing some subclasses of DCFLs. In particular, we show that the finite minimal stacking and “simple” strict restricted (a subclass of strict restricted) deterministic pushdown automata (FMS-DPDAs, SSR-DPDAs, respectively) can be simulated by offline Turing machines simultaneously in space S ( n ) and time n 2 / S ( n ) for any tape function S ( n ) satisfying log n ⩽ S ( n ) ⩽ n which is constructable in n 2 / S ( n ) time. Generalizations are then made for the corresponding classes of 2-way DPDAs.

[1]  Leslie G. Valiant,et al.  Decision procedures for families of deterministic pushdown automata , 1973 .

[2]  Leslie G. Valiant.  The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata , 1974, Inf. Control..

[3]  Etsuro Moriya,et al.  Associate Languages and Derivational Complexity of Formal Grammars and Languages , 1973, Inf. Control..

[4]  Braunmuhl von Braunmuhl,et al.  A recognition algorithm for deterministic CFLs optimal in time and space , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5]  Stephen A. Cook,et al.  Deterministic CFL's are accepted simultaneously in polynomial time and log squared space , 1979, STOC.

[6]  Frederick N. Springsteel,et al.  Language Recognition by Marking Automata , 1972, Inf. Control..

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

[8]  Kurt Mehlhorn,et al.  The Recognition of Deterministic CFL's in Small Time and Space , 1983, Inf. Control..

[9]  Stephen A. Cook,et al.  Linear Time Simulation of Deterministic Two-Way Pushdown Automata , 1971, IFIP Congress.

[10]  Zvi Galil,et al.  Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation , 1974, SWAT.

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

[13]  Rutger Verbeek.  Time-space trade-offs for general recursion , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[14]  Oscar H. Ibarra,et al.  Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata , 1971, J. Comput. Syst. Sci..

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

[16]  Y. IGARASHI.  The Tape Complexity of Some Classes of Szilard Languages , 1977, SIAM J. Comput..

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

[18]  Yoshihide Igarashi.  Tape Bounds for Some Subclasses of Deterministic Context-Free Languages , 1978, Inf. Control..