Minimal DFA for testing divisibility

Authors:
Boris Alexeev
Affiliations:
510 Millstone Cir, Athens, GA
Venue:
Journal of Computer and System Sciences
Year:
2004

Citing 2
Cited 5

Introduction to the Theory of Computation

Introduction to the Theory of Computation
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation

A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Numeration systems: a link between number theory and formal language theory

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Syntactic complexity of ultimately periodic sets of integers

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Challenging the "embarrassingly sequential": parallelizing finite state machine-based computations through principled speculation

Proceedings of the 19th international conference on Architectural support for programming languages and operating systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present and prove a theorem answering the question "how many states does a minimal deterministic finite automaton (DFA) recognizing the set of base-b numbers divisible by k have?"