Enumeration and generation with a string automata representation

Authors:
Marco Almeida;Nelma Moreira;Rogério Reis
Affiliations:
DCC-FC & LIACC, Universidade do Porto, R. do Campo Alegre 1021/1055, 4169-007 Porto, Portugal;DCC-FC & LIACC, Universidade do Porto, R. do Campo Alegre 1021/1055, 4169-007 Porto, Portugal;DCC-FC & LIACC, Universidade do Porto, R. do Campo Alegre 1021/1055, 4169-007 Porto, Portugal
Venue:
Theoretical Computer Science
Year:
2007

Citing 8
Cited 9

Counting strongly connected finite automata

Graph theory with applications to algorithms and computer science
Algorithms

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

Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Boltzmann Samplers for the Random Generation of Combinatorial Structures

Combinatorics, Probability and Computing
Random generation of DFAs

Theoretical Computer Science - Descriptional complexity of formal systems
Interactive manipulation of regular objects with FAdo

ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Exact enumeration of acyclic deterministic automata

Discrete Applied Mathematics
Enumeration and random generation of accessible automata

Theoretical Computer Science

FAdo and GUItar

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Short Regular Expressions from Finite Automata: Empirical Results

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Slowly synchronizing automata and digraphs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Generating, sampling and counting subclasses of regular tree languages

Proceedings of the 14th International Conference on Database Theory
Incremental DFA minimisation

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
COMPAS: a computing package for synchronization

CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
State complexity research and approximation

DLT'11 Proceedings of the 15th international conference on Developments in language theory
The number of DFAs for a given spanning tree

The Journal of Supercomputing
State Elimination Heuristics for Short Regular Expressions

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

Abstract

The representation of combinatorial objects is decisive for the feasibility of several enumerative tasks. In this work, we present a unique string representation for complete initially-connected deterministic automata (ICDFAs) with n states over an alphabet of k symbols. For these strings we give a regular expression and show how they are adequate for exact and random generation, allow an alternative way for enumeration and lead to an upper bound for the number of ICDFAs. The exact generation algorithm can be used to partition the set of ICDFAs in order to parallelize the counting of minimal automata, and thus of regular languages. A uniform random generator for ICDFAs is presented that uses a table of pre-calculated values. Based on the same table, an optimal coding for ICDFAs is obtained.