The Equivalence Problem for t-Turn DPDA Is Co-NP

Géraud Sénizergues. The Equivalence Problem for t-Turn DPDA Is Co-NP. In Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger, editors, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Volume 2719 of Lecture Notes in Computer Science, pages 478-489, Springer, 2003. [doi]

@inproceedings{Senizergues03,
  title = {The Equivalence Problem for t-Turn DPDA Is Co-NP},
  author = {Géraud Sénizergues},
  year = {2003},
  url = {http://link.springer.de/link/service/series/0558/bibs/2719/27190478.htm},
  researchr = {https://researchr.org/publication/Senizergues03},
  cites = {0},
  citedby = {0},
  pages = {478-489},
  booktitle = {Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings},
  editor = {Jos C. M. Baeten and Jan Karel Lenstra and Joachim Parrow and Gerhard J. Woeginger},
  volume = {2719},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40493-7},
}