The complexity of languages resulting from the concatenation operation (Q4609330)
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 6855106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of languages resulting from the concatenation operation |
scientific article; zbMATH DE number 6855106 |
Statements
29 March 2018
0 references
regular languages
0 references
deterministic finite automata
0 references
concatenation
0 references
state complexity
0 references
magic number problem
0 references
0.9660072326660156
0 references
0.8759870529174805
0 references
0.8759353160858154
0 references
0.8661715388298035
0 references
0.8436009883880615
0 references