Random generation of deterministic acyclic automata using Markov chains

Authors:
Vincent Carnino;Sven De Felice
Affiliations:
LIGM, UMR, Université Paris-Est et CNRS, Marne-la-Vallée, France;LIGM, UMR, Université Paris-Est et CNRS, Marne-la-Vallée, France
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 11
Cited 0

Minimisation of acyclic deterministic automata in linear time

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
A calculus for the random generation of labelled combinatorial structures

Theoretical Computer Science
Characterization of Glushkov automata

Theoretical Computer Science
Generating connected acyclic digraphs uniformly at random

Information Processing Letters
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
Enumeration and random generation of accessible automata

Theoretical Computer Science
Small Extended Expressions for Acyclic Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Exact enumeration of acyclic deterministic automata

Discrete Applied Mathematics
Acyclic automata and small expressions using multi-tilde-bar operators

Theoretical Computer Science
Parametric random generation of deterministic tree automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article we propose an algorithm, based on Markov chain techniques, to generate random automata that are deterministic, accessible and acyclic. The distribution of the output approaches the uniform distribution on n-state such automata. We then show how to adapt this algorithm in order to generate minimal acyclic automata with n states almost uniformly.