The complexity of concatenation on deterministic and alternating finite automata (Q5223613)
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: The complexity of concatenation on deterministic and alternating finite automata |
scientific article; zbMATH DE number 7082325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of concatenation on deterministic and alternating finite automata |
scientific article; zbMATH DE number 7082325 |
Statements
The complexity of concatenation on deterministic and alternating finite automata (English)
0 references
18 July 2019
0 references
regular languages
0 references
finite automata
0 references
concatenation
0 references
state complexity
0 references
0.90136945
0 references
0.90136945
0 references
0.89656055
0 references
0.8851069
0 references
0 references
0.8736265
0 references
0.8725602
0 references
0.87060785
0 references
0.87060785
0 references
0.8649824
0 references
