VOLUME 12 2007 NUMBERS 1–2

On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata
Andreas Malcher
Pages 265–277





Download Abstract
Fulltext is accessible with your personal account
ShowHide BibTeX
BibTeX:
@article{JALC-2007-265,
  author  = {Andreas Malcher},
  title   = {On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata},
  journal = {Journal of Automata, Languages and Combinatorics},
  volume  = {12},
  number  = {1--2},
  pages   = {265--277},
  year    = {2007},
  url     = {https://doi.org/10.25596/jalc-2007-265},
  doi     = {10.25596/jalc-2007-265}
}
If you would like to see an embedded preview, try to select preview as the action for Portable Document Format (PDF) in your brower settings.
Keywords: pushdown automata, finite-turn, descriptional complexity, trade-offs
DOI: 10.25596/jalc-2007-265