Paper Abstract and Keywords |
Presentation |
2020-12-04 10:40
Efficient Construction of Cryptarithm Catalogues over DFA Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2020-20 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a player must discover an assignment of numerals on letters that makes the equation hold true. A preceding study proposed a method to enumerate all solvable cryptarithms over an extension of DFAs for different bases up to 7. Resolving the problems proposed in the preceding study, this paper proposes an even more efficient way to represent solvable cryptarithms in DFAs. We succeeded in constructing a cryptarithm DFA for bases up to 9. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
cryptartihm / alphametic / automaton / DFA / enumeration / data compression / / |
Reference Info. |
IEICE Tech. Rep., vol. 120, no. 276, COMP2020-20, pp. 16-23, Dec. 2020. |
Paper # |
COMP2020-20 |
Date of Issue |
2020-11-27 (COMP) |
ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2020-20 |
Conference Information |
Committee |
COMP |
Conference Date |
2020-12-04 - 2020-12-04 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Online |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2020-12-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Efficient Construction of Cryptarithm Catalogues over DFA |
Sub Title (in English) |
|
Keyword(1) |
cryptartihm |
Keyword(2) |
alphametic |
Keyword(3) |
automaton |
Keyword(4) |
DFA |
Keyword(5) |
enumeration |
Keyword(6) |
data compression |
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Koya Watanabe |
1st Author's Affiliation |
Tohoku University (Tohoku Univ.) |
2nd Author's Name |
Diptarama Hendrian |
2nd Author's Affiliation |
Tohoku University (Tohoku Univ.) |
3rd Author's Name |
Ryo Yoshinaka |
3rd Author's Affiliation |
Tohoku University (Tohoku Univ.) |
4th Author's Name |
Takashi Horiyama |
4th Author's Affiliation |
Hokkaido University (Hokkaido Univ.) |
5th Author's Name |
Ayumi Shinohara |
5th Author's Affiliation |
Tohoku University (Tohoku Univ.) |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2020-12-04 10:40:00 |
Presentation Time |
30 minutes |
Registration for |
COMP |
Paper # |
COMP2020-20 |
Volume (vol) |
vol.120 |
Number (no) |
no.276 |
Page |
pp.16-23 |
#Pages |
8 |
Date of Issue |
2020-11-27 (COMP) |
|