State complexity of permutation on finite languages over a binary alphabet (Q2358683)
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 6731757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | State complexity of permutation on finite languages over a binary alphabet |
scientific article; zbMATH DE number 6731757 |
Statements
State complexity of permutation on finite languages over a binary alphabet (English)
0 references
15 June 2017
0 references
state complexity
0 references
finite automata
0 references
finite languages
0 references
Parikh equivalence
0 references
0 references
0 references
0 references
0.8916077613830566
0 references
0.7638645172119141
0 references
0.7530144453048706
0 references
