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

zbMATH Open1472.68075MaRDI QIDQ5146754FDOQ5146754

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

Publication date: 26 January 2021

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

Recommendations

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

zbMATH Keywords

addition chainprefix codeMoore automatonfinite-state machine

Mathematics Subject Classification ID

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

Cites Work

• Universal codeword sets and representations of the integers
• Title not available (Why is that?)
• Theoretical computer science. Cumulative index, volumes 1-100 (1992)
• Computing Sequences with Addition Chains

Cited In (2)

• Codes and automata in minimal sets
• On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality

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

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