External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Equivalence Problem for Deterministic Pushdown Automata is Decidable

Géraud Sénizergues. The Equivalence Problem for Deterministic Pushdown Automata is Decidable. In Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, ICALP 97, Bologna, Italy, 7-11 July 1997, Proceedings. Volume 1256 of Lecture Notes in Computer Science, pages 671-681, Springer, 1997.

Authors

Géraud Sénizergues

This author has not been identified. Look up 'Géraud Sénizergues' in Google
runs on