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 Computing Maximal Word Functions

Danilo Bruschi, Giovanni Pighizzini. The Complexity of Computing Maximal Word Functions. In Lothar Budach, editor, Fundamentals of Computation Theory, 8th International Symposium, FCT 91, Gosen, Germany, September 9-13, 1991, Proceedings. Volume 529 of Lecture Notes in Computer Science, pages 157-167, Springer, 1991.

Abstract

Abstract is missing.

runs on