Improved bounds on the number of automata accepting finite languages

Authors:
Mike Domaratzki
Affiliations:
School of Computing, Queen's University, Kingston, ON, Canada
Venue:
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Year:
2002

Citing 1
Cited 2

Counting strongly connected finite automata

Graph theory with applications to algorithms and computer science

Exact enumeration of acyclic deterministic automata

Discrete Applied Mathematics
On enumeration of Müller automata

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We improve the known bounds on the number of pairwise non-isomorphic minimal deterministic finite automata (DFAs) on n states which accept finite languages. The lower bound constructions are iterative approaches which yield recurrence relations.