Minimal DFA for testing divisibility

DOI10.1016/j.jcss.2004.02.001zbMath1076.68038OpenAlexW2051947672MaRDI QIDQ1880782

Boris Alexeev

Publication date: 1 October 2004

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.02.001

zbMATH Keywords

deterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Computational aspects of sturdy and flimsy numbers, Magic Numbers in Periodic Sequences, Separating Words from Every Start State with Horner Automata, Unnamed Item, A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems, Minimal automaton for multiplying and translating the Thue-Morse set, A DECISION PROBLEM FOR ULTIMATELY PERIODIC SETS IN NONSTANDARD NUMERATION SYSTEMS

Cites Work

• Unnamed Item
• Unnamed Item