"Complexity of problems concerning reset words for commutative automata and ..."

Pavel V. Martyugin (2008)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2012-09-05

- no documents available
- export record
  dblp key:
  - conf/afl/Martyugin08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/afl/Martyugin08
Pavel V. Martyugin:
Complexity of problems concerning reset words for commutative automata and automata with simple idempotents. AFL 2008: 314-324

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.