@inproceedings{10.1007/3-540-45132-3_7,
    Abstract = {The equivalence problem for deterministic pushdown automata has been shown decidable in [S{\'e}n97c,{\'e}n97a,S{\'e}n97b,{\'e}n01,Sti99]. We give some applications of this decidability result to other problems arising in the following areas of theoretical computer science:programming languages theoryinfinite graph theoryThue-systems},
    Address = {Berlin, Heidelberg},
    Author = {S{\'e}nizergues, G{\'e}raud},
    BookTitle = {Machines, Computations, and Universality},
    Editor = {Margenstern, Maurice and Rogozhin, Yurii},
    File = {Sénizergues2001\_Chapter\_SomeApplicationsOfTheDecidabil (0) - a - a - f.pdf},
    ISBN = {978-3-540-45132-7},
    Pages = {114--132},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Some Applications of the Decidability of DPDA's Equivalence},
    Year = {2001},
    date-added = {2018-10-04 15:31:43 +0000},
    date-modified = {2018-10-04 15:31:43 +0000},
    doi = {10.1007/3-540-45132-3_7}
}

@inproceedings{10.1007/3-540-45132-3_7, Abstract = {The equivalence problem for deterministic pushdown automata has been shown decidable in [S{\'e}n97c,{\'e}n97a,S{\'e}n97b,{\'e}n01,Sti99]. We give some applications of this decidability result to other problems arising in the following areas of theoretical computer science:programming languages theoryinfinite graph theoryThue-systems}, Address = {Berlin, Heidelberg}, Author = {S{\'e}nizergues, G{\'e}raud}, BookTitle = {Machines, Computations, and Universality}, Editor = {Margenstern, Maurice and Rogozhin, Yurii}, File = {Sénizergues2001_Chapter_SomeApplicationsOfTheDecidabil (0) - a - a - f.pdf}, ISBN = {978-3-540-45132-7}, Pages = {114--132}, Publisher = {Springer Berlin Heidelberg}, Title = {Some Applications of the Decidability of DPDA's Equivalence}, Year = {2001}, date-added = {2018-10-04 15:31:43 +0000}, date-modified = {2018-10-04 15:31:43 +0000}, doi = {10.1007/3-540-45132-3_7} }