@article{https://doi.org/10.48550/arxiv.2105.02611,<br/><span class="tab"></span>
  doi = {10.48550/ARXIV.2105.02611},<br/><span class="tab"></span>
  url = {https://arxiv.org/abs/2105.02611},<br/><span class="tab"></span>
  author = {Guha,<br/><span class="tab"></span> Shibashis and Jecker,<br/><span class="tab"></span> Ismaël and Lehtinen,<br/><span class="tab"></span> Karoliina and Zimmermann,<br/><span class="tab"></span> Martin},<br/><span class="tab"></span>
  keywords = {Formal Languages and Automata Theory (cs.FL),<br/><span class="tab"></span> Logic in Computer Science (cs.LO),<br/><span class="tab"></span> FOS: Computer and information sciences,<br/><span class="tab"></span> FOS: Computer and information sciences},<br/><span class="tab"></span>
  title = {A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct},<br/><span class="tab"></span>
  publisher = {arXiv},<br/><span class="tab"></span>
  year = {2021},<br/><span class="tab"></span>
  copyright = {Creative Commons Attribution 4.0 International}
}