State complexity of permutation on finite languages over a binary alphabet (Q2358683)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | State complexity of permutation on finite languages over a binary alphabet |
scientific article |
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
