On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality

MaRDI QIDQ5147397zbMATH OpenFDO

Authors I. R. Akishev, M. È. Dvorkin

Publication date 26 January 2021

Full work available at URL http://mathnet.ru/eng/pdm183

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• On constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality
• Note on minimal finite automata
• scientific article; zbMATH DE number 4108164
• A fast and simple algorithm for constructing minimal acyclic deterministic finite automata
• scientific article; zbMATH DE number 4037214

Cites work

• Computing Sequences with Addition Chains
• On the efficiency of one-time digital signatures

Cited in

(1)

• On constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality

This page was built for publication: On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147397)