@inproceedings{10.1007/3-540-45465-9_4,
    Abstract = {In his paper (Theoretical Computer Science, Vol 251 (2001), pages 1---166), the author gives a positive solution to the decidability of the equivalence problem for deterministic pushdown automata: Given two languages L1 and L2 accepted by deterministic pushdown automata decide whether L1=L2. The problem was posed by S. Ginsburg and S. Greibach in 1966 and various subcases were shown to be decidable over years. However, the full question remained elusive until it was finally settled by the awarded. He showed the problem to be decidable. The paper not only settles the equivalence problem for deterministic context-free languages, but also develops an entire machinery of new techniques which are likely to be useful in other contexts. They have already found useful in semantics of programming languages.},
    Address = {Berlin, Heidelberg},
    Author = {S{\'e}nizergues, G{\'e}raud},
    BookTitle = {Automata, Languages and Programming},
    Editor = {Widmayer, Peter and Eidenbenz, Stephan and Triguero, Francisco and Morales, Rafael and Conejo, Ricardo and Hennessy, Matthew},
    File = {Sénizergues2002\_Chapter\_LALBDecidabilityResultsFromCom (0) - a - a - h.pdf},
    ISBN = {978-3-540-45465-6},
    Pages = {37--37},
    Publisher = {Springer Berlin Heidelberg},
    Title = {L(A) = L(B)? Decidability Results from Complete Formal Systems},
    Year = {2002},
    date-added = {2018-10-04 15:42:21 +0000},
    date-modified = {2018-10-04 15:42:21 +0000},
    doi = {10.1007/3-540-45465-9_4}
}

@inproceedings{10.1007/3-540-45465-9_4, Abstract = {In his paper (Theoretical Computer Science, Vol 251 (2001), pages 1---166), the author gives a positive solution to the decidability of the equivalence problem for deterministic pushdown automata: Given two languages L1 and L2 accepted by deterministic pushdown automata decide whether L1=L2. The problem was posed by S. Ginsburg and S. Greibach in 1966 and various subcases were shown to be decidable over years. However, the full question remained elusive until it was finally settled by the awarded. He showed the problem to be decidable. The paper not only settles the equivalence problem for deterministic context-free languages, but also develops an entire machinery of new techniques which are likely to be useful in other contexts. They have already found useful in semantics of programming languages.}, Address = {Berlin, Heidelberg}, Author = {S{\'e}nizergues, G{\'e}raud}, BookTitle = {Automata, Languages and Programming}, Editor = {Widmayer, Peter and Eidenbenz, Stephan and Triguero, Francisco and Morales, Rafael and Conejo, Ricardo and Hennessy, Matthew}, File = {Sénizergues2002_Chapter_LALBDecidabilityResultsFromCom (0) - a - a - h.pdf}, ISBN = {978-3-540-45465-6}, Pages = {37--37}, Publisher = {Springer Berlin Heidelberg}, Title = {L(A) = L(B)? Decidability Results from Complete Formal Systems}, Year = {2002}, date-added = {2018-10-04 15:42:21 +0000}, date-modified = {2018-10-04 15:42:21 +0000}, doi = {10.1007/3-540-45465-9_4} }