The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata

@article{Valiant1974TheEP,
  title={The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata},
  author={Leslie G. Valiant},
  journal={Information and Control},
  year={1974},
  volume={25},
  pages={123-133}
}
A deterministic pushdown automaton (dpda) is described as finite-turn if there is a bound on the number of times the direction of the stack movement can change in the set of all derivations from the starting configuration. The purpose of this paper is to show that there exists a procedure for deciding whether two such finite-turn machines recognize the same language. By virtue of a direct correspondence between a restricted class of one-turn dpda and deterministic two-tape acceptors (Valiant… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Finite - turn pushdown automata , S I A

S. GINSBURG, E. H. SPANIER
M J . on Control • 1966

Similar Papers

Loading similar papers…