On the state complexity of partial word DFAs (Q2344741)
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 state complexity of partial word DFAs |
scientific article; zbMATH DE number 6436193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the state complexity of partial word DFAs |
scientific article; zbMATH DE number 6436193 |
Statements
On the state complexity of partial word DFAs (English)
0 references
18 May 2015
0 references
automata
0 references
formal languages
0 references
state complexity
0 references
regular languages
0 references
partial languages
0 references
partial words
0 references
deterministic finite automata
0 references
non-deterministic finite automata
0 references
0.9745512008666992
0 references
0.8329294323921204
0 references
0.8329152464866638
0 references
0.803142249584198
0 references
0.8002749681472778
0 references
