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.

Combinatorial Complexity of Regular Languages

Arseny M. Shur. Combinatorial Complexity of Regular Languages. In Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko, editors, Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings. Volume 5010 of Lecture Notes in Computer Science, pages 289-301, Springer, 2008. [doi]

Abstract

Abstract is missing.

runs on