State complexity of GF(2)-operations on unary languages (Q2113387)
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 7488459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of GF(2)-operations on unary languages |
scientific article; zbMATH DE number 7488459 |
Statements
State complexity of GF(2)-operations on unary languages (English)
0 references
14 March 2022
0 references
GF(2)-concatenation
0 references
GF(2)-inverse
0 references
GF(2)-star
0 references
state complexity
0 references
primitive polynomials
0 references
0 references
0.9824615716934204
0 references
0.8464276194572449
0 references
0.8416202068328857
0 references
0.8333376049995422
0 references
