@inproceedings{https://doi.org/10.4230/lipics.concur.2021.3,
    doi = {10.4230/LIPICS.CONCUR.2021.3},
    url = {https://drops.dagstuhl.de/opus/volltexte/2021/14380/},
    author = {Doveri, Kyveli and Ganty, Pierre and Parolini, Francesco and Ranzato, Francesco},
    keywords = {Büchi (Pushdown) Automata, {$\omega$}-Language Inclusion, Well-quasiorders, Theory of computation → Formal languages and automata theory},
    language = {en},
    title = {Inclusion Testing of Büchi Automata Based on Well-Quasiorders},
    publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
    year = {2021},
    copyright = {Creative Commons Attribution 4.0 International license}
}

@inproceedings{https://doi.org/10.4230/lipics.concur.2021.3, doi = {10.4230/LIPICS.CONCUR.2021.3}, url = {https://drops.dagstuhl.de/opus/volltexte/2021/14380/}, author = {Doveri, Kyveli and Ganty, Pierre and Parolini, Francesco and Ranzato, Francesco}, keywords = {Büchi (Pushdown) Automata, {$\omega$}-Language Inclusion, Well-quasiorders, Theory of computation → Formal languages and automata theory}, language = {en}, title = {Inclusion Testing of Büchi Automata Based on Well-Quasiorders}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, year = {2021}, copyright = {Creative Commons Attribution 4.0 International license} }