On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality (Q5147397)
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 constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality |
scientific article; zbMATH DE number 7301801
| 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 given cardinality |
scientific article; zbMATH DE number 7301801 |
Statements
26 January 2021
0 references
0.9984449744224548
0 references
0.7614501118659973
0 references
