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 Complexity of the Inequivalence Problem for Regular Expressions with Intersection

Martin Fürer. The Complexity of the Inequivalence Problem for Regular Expressions with Intersection. In J. W. de Bakker, Jan van Leeuwen, editors, Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherland, July 14-18, 1980, Proceedings. Volume 85 of Lecture Notes in Computer Science, pages 234-245, Springer, 1980.

Abstract

Abstract is missing.

runs on