PSPACE-completeness of the problem of checking the careful synchronizability of a partial automaton (Q3450095)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6503306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PSPACE-completeness of the problem of checking the careful synchronizability of a partial automaton |
scientific article; zbMATH DE number 6503306 |
Statements
2 November 2015
0 references
0.8917542099952698
0 references
0.8727616667747498
0 references
0.8605948686599731
0 references
0.8407498002052307
0 references
0.8162626028060913
0 references
