Computing Downward Closures for Stacked Counter Automata

Georg Zetzsche. Computing Downward Closures for Stacked Counter Automata. In Ernst W. Mayr, Nicolas Ollinger, editors, 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany. Volume 30 of LIPIcs, pages 743-756, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

@inproceedings{Zetzsche15,
  title = {Computing Downward Closures for Stacked Counter Automata},
  author = {Georg Zetzsche},
  year = {2015},
  doi = {10.4230/LIPIcs.STACS.2015.743},
  url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2015.743},
  researchr = {https://researchr.org/publication/Zetzsche15},
  cites = {0},
  citedby = {0},
  pages = {743-756},
  booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany},
  editor = {Ernst W. Mayr and Nicolas Ollinger},
  volume = {30},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-78-1},
}