On the number of distinct languages accepted by finite automata with n states

Authors:
Michael Domaratzki;Derek Kisman;Jeffrey Shallit
Affiliations:
School of Computer Science, Queen's University, Kingston, ON KTL 3N6, Canada;5760 Buckboard Rd. NW, Calgary, AB T3A 4R6, Canada;School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada
Venue:
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Year:
2002

Citing 8
Cited 23

On the number of non-isomorphic strongly connected finite automata

Journal of Information Processing and Cybernetics
Counting strongly connected finite automata

Graph theory with applications to algorithms and computer science
Automaticity I: properties of a measure of descriptional complexity

Journal of Computer and System Sciences
Automaticity II: descriptional complexity in the unary case

Theoretical Computer Science
NFA to DFA transformation for finite languages over arbitrary alphabets

Journal of Automata, Languages and Combinatorics
Tight bounds on the number of states of DFAs that are equivalent to n-state NFAs

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Mathematical Machine Theory

Introduction to Mathematical Machine Theory

On binary ⊕-NFAs and succinct descriptions of regular languages

Theoretical Computer Science - Implementation and application of automata
Random generation of DFAs

Theoretical Computer Science - Descriptional complexity of formal systems
Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
Exact enumeration of acyclic deterministic automata

Discrete Applied Mathematics
Automata Recognizing No Words: A Statistical Approach

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Minimizing nfa's and regular expressions

Journal of Computer and System Sciences
Enumeration and random generation of accessible automata

Theoretical Computer Science
Enumeration and generation with a string automata representation

Theoretical Computer Science
On the average state and transition complexity of finite languages

Theoretical Computer Science
Regular expressions: new results and open problems

Journal of Automata, Languages and Combinatorics
Enumeration of context-free languages and related structures

Journal of Automata, Languages and Combinatorics
Learning unary automata

Journal of Automata, Languages and Combinatorics
State complexity of power

Theoretical Computer Science
Compact Normal Form for Regular Languages as Xor Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
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
Succinct descriptions of regular languages with binary ⊕-NFAs

CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Learning finite automata using label queries

ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Complexity in union-free regular languages

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Minimizing NFA's and regular expressions

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Enumerating regular expressions and their languages

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Automata Recognizing No Words: A Statistical Approach

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
The number of DFAs for a given spanning tree

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give asymptotic estimates and some explicit computations for both the number of distinct languages and the number of distinct finite languages over a k-letter alphabet that are accepted by deterministic finite automata (resp. nondeterministic finite automata) with n states.