Complexity of a problem concerning reset words for Eulerian binary automata (Q515691)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity of a problem concerning reset words for Eulerian binary automata |
scientific article; zbMATH DE number 6695657
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of a problem concerning reset words for Eulerian binary automata |
scientific article; zbMATH DE number 6695657 |
Statements
Complexity of a problem concerning reset words for Eulerian binary automata (English)
0 references
16 March 2017
0 references
