On comparing deterministic finite automata and the shuffle of words (Q3192254)
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 comparing deterministic finite automata and the shuffle of words |
scientific article; zbMATH DE number 6348291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On comparing deterministic finite automata and the shuffle of words |
scientific article; zbMATH DE number 6348291 |
Statements
On Comparing Deterministic Finite Automata and the Shuffle of Words (English)
0 references
26 September 2014
0 references
0.8516333103179932
0 references
0.8348456621170044
0 references
0.8305365443229675
0 references
0.7925068140029907
0 references
0.7851202487945557
0 references
