On the Computational Complexity of Partial Word Automata Problems (Q4589235)
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 Partial Word Automata Problems |
scientific article; zbMATH DE number 6804753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Computational Complexity of Partial Word Automata Problems |
scientific article; zbMATH DE number 6804753 |
Statements
On the Computational Complexity of Partial Word Automata Problems (English)
0 references
9 November 2017
0 references
0.92585063
0 references
0.91570544
0 references
0.9150789
0 references
0.9039136
0 references
0.9019554
0 references
0.8900453
0 references
0.8900453
0 references
