Enumeration of cryptarithms using deterministic finite automata

DOI10.1007/978-3-319-94812-6_24MaRDI QIDQ1616985zbMATH OpenOpenAlexFDO

Authors Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara

Publication date 7 November 2018

Full work available at URL https://arxiv.org/abs/1807.11580

zbMATH Keywords

DFAenumerationautomatonalphameticscryptartihms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Extreme alphametics
• scientific article; zbMATH DE number 35073
• Counting optimal joint digit expansions
• CRYPTAUTOMATA WITH FUNCTIONAL KEYS
• Finite automata in cryptography

Cited in

(4)

• Extreme alphametics
• Zero-knowledge proof protocol for cryptarithmetic using dihedral cards
• scientific article; zbMATH DE number 7528066 (Why is no real title available?)
• scientific article; zbMATH DE number 35073 (Why is no real title available?)

This page was built for publication: Enumeration of cryptarithms using deterministic finite automata

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