On constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality (Q5146754)
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 7301730
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality |
scientific article; zbMATH DE number 7301730 |
Statements
26 January 2021
0 references
prefix code
0 references
finite-state machine
0 references
Moore automaton
0 references
addition chain
0 references
0.9984449744224548
0 references
0.7614589333534241
0 references
0.7600168585777283
0 references
