@inproceedings{a193e324e71648c2a5a53810d2a377c5,
title = "Deciding DPDA Equivalence Is Primitive Recursive",
abstract = "Recently S{\'e}nizergues showed decidability of the equivalence problem for deterministic pushown automata. The proof of decidability is two semi-decision procedures that do not give a complexity upper bound for the problem. Here we show that there is a simpler deterministic decision procedure that has a primitive recursive upper bound.",
author = "Colin Stirling",
year = "2002",
doi = "10.1007/3-540-45465-9_70",
language = "English",
isbn = "978-3-540-43864-9",
series = "Lecture Notes in Computer Science",
publisher = "Springer Berlin Heidelberg",
pages = "821--832",
booktitle = "Automata, Languages and Programming",
}