A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann 0002. A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. In Filippo Bonchi, Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Volume 202 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

@inproceedings{GuhaJL021,
  title = {A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct},
  author = {Shibashis Guha and Ismaël Jecker and Karoliina Lehtinen and Martin Zimmermann 0002},
  year = {2021},
  doi = {10.4230/LIPIcs.MFCS.2021.53},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.53},
  researchr = {https://researchr.org/publication/GuhaJL021},
  cites = {0},
  citedby = {0},
  booktitle = {46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia},
  editor = {Filippo Bonchi and Simon J. Puglisi},
  volume = {202},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-201-3},
}