Algorithmic Theory of WQOs

Schnoebelen, 2010

Summary

Philippe Schnoebelen (2010) Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets MFCS 2010 Lecture Notes in Computer Science Petr Hlinený and Antonín Kucera Springer 616–628 (URL)

BibTeX entry

@INPROCEEDINGS { Schnoebelen10b,
    AUTHOR = { {\relax Ph}ilippe Schnoebelen },
    BOOKTITLE = { MFCS 2010 },
    EDITOR = { Petr Hlinen\'y and Anton\'in Kucera },
    CONFNAME = { International Symposium on Mathematical Foundations of Computer Science },
    CONFNUM = { 35th },
    PUBLISHER = { Springer },
    SERIES = { Lecture Notes in Computer Science },
    VOLUME = { },
    PAGES = { 616--628 },
    TITLE = { Revisiting {A}ckermann-Hardness for Lossy Counter Machines and Reset {P}etri Nets },
    YEAR = { 2010 },
    DOI = { 10.1007/978-3-642-15155-2_54 },
}