On the computational complexity of the freezing non-strict majority automata (Q1704107)
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: On the computational complexity of the freezing non-strict majority automata |
scientific article; zbMATH DE number 6848210
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of the freezing non-strict majority automata |
scientific article; zbMATH DE number 6848210 |
Statements
On the computational complexity of the freezing non-strict majority automata (English)
0 references
8 March 2018
0 references
