Random Generation of Deterministic Acyclic Automata Using the Recursive Method
暂无分享,去创建一个
[1] Valery A. Liskovets,et al. Exact enumeration of acyclic deterministic automata , 2006, Discret. Appl. Math..
[2] A. Nijenhuis. Combinatorial algorithms , 1975 .
[3] Philippe Flajolet,et al. A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..
[4] Nelma Moreira,et al. Exact Generation of Minimal Acyclic Deterministic Finite Automata , 2008, Int. J. Found. Comput. Sci..
[5] R. Stanley,et al. Enumerative Combinatorics: Index , 1999 .
[6] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[7] Grzegorz Rozenberg,et al. Developments in Language Theory II , 2002 .
[8] Michael Domaratzki. Improved Bounds On The Number Of Automata Accepting Finite Languages , 2004, Int. J. Found. Comput. Sci..
[9] Ines Klimann,et al. On the Finiteness Problem for Automaton (Semi)Groups , 2011, Int. J. Algebra Comput..
[10] Jeffrey Shallit,et al. On the Number of Distinct Languages Accepted by Finite Automata with n States , 2002, DCFS.
[11] R. Stanley. Enumerative Combinatorics: Volume 1 , 2011 .
[12] P. Flajolet,et al. Analytic Combinatorics: RANDOM STRUCTURES , 2009 .
[13] Vincent Carnino,et al. Sampling different kinds of acyclic automata using Markov chains , 2012, Theor. Comput. Sci..