External Links

Cite Key

Statistics

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

PDF

Tags

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.

Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms

Sebastian Bala. Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms. In Volker Diekert, Michel Habib, editors, STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings. Volume 2996 of Lecture Notes in Computer Science, pages 596-607, Springer, 2004. [doi]

Abstract

Abstract is missing.

runs on