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.

Computational Complexity of NFA Minimization for Finite and Unary Languages

Hermann Gruber, Markus Holzer. Computational Complexity of NFA Minimization for Finite and Unary Languages. In Remco Loos, Szilárd Zsolt Fazekas, Carlos Martín-Vide, editors, LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications. Volume Report 35/07 of pages 261-272, Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, 2007.

Abstract

Abstract is missing.

runs on