Random Generation of Deterministic Acyclic Automata Using Markov Chains
Résumé
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.
Domaines
Mathématique discrète [cs.DM]
Fichier principal
Random_Generation_of_Deterministic_Acyclic_Automata_Using_Markov_Chains.pdf (149.28 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...