 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
Random Generation of Deterministic Acyclic Automata Using Markov Chains
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.
Cited literature [15 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-00841862
Contributor : Cyril Nicaud <>
Submitted on : Sunday, July 7, 2013 - 11:17:13 AM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM
Long-term archiving on: : Tuesday, October 8, 2013 - 2:35:12 AM
Contributor : Cyril Nicaud <>
Submitted on : Sunday, July 7, 2013 - 11:17:13 AM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM
Long-term archiving on: : Tuesday, October 8, 2013 - 2:35:12 AM
File
Random_Generation_of_Determini...
Files produced by the author(s)