On the accepting state complexity of operations on permutation automata (Q6186540)
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: On the accepting state complexity of operations on permutation automata |
scientific article; zbMATH DE number 7799055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the accepting state complexity of operations on permutation automata |
scientific article; zbMATH DE number 7799055 |
Statements
On the accepting state complexity of operations on permutation automata (English)
0 references
2 February 2024
0 references
permutation automata
0 references
language operations
0 references
accepting state complexity
0 references
descriptional complexity
0 references
0 references
0.9995260834693908
0 references
0.8997538089752197
0 references
0.8931185007095337
0 references
0.8865070939064026
0 references
0.837177574634552
0 references
