Enumeration of cryptarithms using deterministic finite automata (Q1616985)

From MaRDI portal
Revision as of 19:44, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Enumeration of cryptarithms using deterministic finite automata
scientific article

    Statements

    Enumeration of cryptarithms using deterministic finite automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2018
    0 references
    0 references
    cryptartihms
    0 references
    alphametics
    0 references
    automaton
    0 references
    DFA
    0 references
    enumeration
    0 references
    0 references