"Complexity of a problem concerning reset words for Eulerian binary automata."

Vojtech Vorel (2017)

> Home

Details and statistics

DOI: 10.1016/J.IC.2016.06.013

access: closed

type: Journal Article

metadata version: 2017-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/iandc/Vorel17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Vorel17
Vojtech Vorel:
Complexity of a problem concerning reset words for Eulerian binary automata. Inf. Comput. 253: 497-509 (2017)

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.