Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression

Tomás Pecka, Jan Trávnícek, Radomír Polách, Jan Janousek. Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. In Pedro Rangel Henriques, José Paulo Leal, António Menezes Leitão, Xavier Gómez Guinovart, editors, 7th Symposium on Languages, Applications and Technologies, SLATE 2018, June 21-22, 2018, Guimaraes, Portugal. Volume 62 of OASICS, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

@inproceedings{PeckaTPJ18,
  title = {Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression},
  author = {Tomás Pecka and Jan Trávnícek and Radomír Polách and Jan Janousek},
  year = {2018},
  doi = {10.4230/OASIcs.SLATE.2018.6},
  url = {https://doi.org/10.4230/OASIcs.SLATE.2018.6},
  researchr = {https://researchr.org/publication/PeckaTPJ18},
  cites = {0},
  citedby = {0},
  booktitle = {7th Symposium on Languages, Applications and Technologies, SLATE 2018, June 21-22, 2018, Guimaraes, Portugal},
  editor = {Pedro Rangel Henriques and José Paulo Leal and António Menezes Leitão and Xavier Gómez Guinovart},
  volume = {62},
  series = {OASICS},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-072-9},
}