A Simulation Result for Two-Way Pushdown Automata

@article{Rytter1983ASR,
  title={A Simulation Result for Two-Way Pushdown Automata},
  author={Wojciech Rytter},
  journal={Inf. Process. Lett.},
  year={1983},
  volume={16},
  pages={199-202}
}
In this paper we consider time and space complexity of languages recognized by two-way deterministic pushdown automata with k input heads (2dpda(k)‘s, for short). Using the pyramidal structure of Schonhage [7] we design an algorithm simulating 2dpda(k)‘s in O(r) time and space, where r is the number of reachable (during the computation for a given input word) surface configurations. If the computation of 2dpda(k) is ‘sparse’, then r is an improvement upon O(nk). This generalizes the result of… CONTINUE READING
2 Citations
3 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

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

A note on the complexity of traversing a labyrinth

  • W. Rytter
  • Graph Theory Conf.,
  • 1980

Similar Papers

Loading similar papers…