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.

Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages

Stefano Varricchio. Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages. In Patrice Enjalbert, Alain Finkel, Klaus W. Wagner, editors, STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzburg, Germany, February 25-27, 1993, Proceedings. Volume 665 of Lecture Notes in Computer Science, pages 595-606, Springer, 1993.

Abstract

Abstract is missing.

runs on