On the state complexity of partial word DFAs (Q2344741): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
Revision as of 12:49, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the state complexity of partial word DFAs |
scientific article |
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
