@inproceedings{Senizergues:ICALP:1997,
    Abstract = {The equivalence problem for deterministic pushdown automata is shown to be decidable. We exhibit a complete formal system for deducing equivalent pairs of deterministic rational series on the alphabet associated with a dpda M.},
    Address = {Berlin, Heidelberg},
    Author = {S{\'e}nizergues, G{\'e}raud},
    BookTitle = {Proc. of ICALP'97},
    Editor = {Degano, Pierpaolo and Gorrieri, Roberto and Marchetti-Spaccamela, Alberto},
    File = {Sénizergues1997\_Chapter\_TheEquivalenceProblemForDeterm (0) - a - a - r.pdf},
    ISBN = {978-3-540-69194-5},
    Pages = {671--681},
    Publisher = {Springer Berlin Heidelberg},
    Title = {The equivalence problem for deterministic pushdown automata is decidable},
    Year = {1997},
    date-added = {2018-10-04 15:18:19 +0000},
    date-modified = {2020-06-11 09:05:56 +0200},
    doi = {10.1007/3-540-63165-8_221}
}

@inproceedings{Senizergues:ICALP:1997, Abstract = {The equivalence problem for deterministic pushdown automata is shown to be decidable. We exhibit a complete formal system for deducing equivalent pairs of deterministic rational series on the alphabet associated with a dpda M.}, Address = {Berlin, Heidelberg}, Author = {S{\'e}nizergues, G{\'e}raud}, BookTitle = {Proc. of ICALP'97}, Editor = {Degano, Pierpaolo and Gorrieri, Roberto and Marchetti-Spaccamela, Alberto}, File = {Sénizergues1997_Chapter_TheEquivalenceProblemForDeterm (0) - a - a - r.pdf}, ISBN = {978-3-540-69194-5}, Pages = {671--681}, Publisher = {Springer Berlin Heidelberg}, Title = {The equivalence problem for deterministic pushdown automata is decidable}, Year = {1997}, date-added = {2018-10-04 15:18:19 +0000}, date-modified = {2020-06-11 09:05:56 +0200}, doi = {10.1007/3-540-63165-8_221} }