Enumeration of cryptarithms using deterministic finite automata

DOI10.1007/978-3-319-94812-6_24OpenAlexW2810021157MaRDI QIDQ1616985

Ayumi Shinohara, Diptarama Hendrian, Ryo Yoshinaka, Yuki Nozaki

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)

Related Items

Zero-knowledge proof protocol for cryptarithmetic using dihedral cards

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