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.

Complexity of problems concerning reset words for commutative automata and automata with simple idempotents

Pavel V. Martyugin. Complexity of problems concerning reset words for commutative automata and automata with simple idempotents. In Erzsébet Csuhaj-Varjú, Zoltán Ésik, editors, Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings. pages 314-324, 2008.

Possibly Related Publications

The following publications are possibly variants of this publication:

runs on