Методы построения конечных автоматов на основе ...

17486. Larranaga P., Lozano J. A. Estimation of distribution algorithms: A newtool for evolutionary computation. Kluwer Academic Publishers. Boston,2002.87. Levy S. Artificial Life: The Quest for a New Creation. NY: Pantheon,1992.88. Lucas S., Reynolds J. Learning DFA: Evolution versus Evidence DrivenState Merging / The 2003 Congress on Evolutionary Computation(CEC '03). Vol. 1, pp. 351 – 358.89. Lucas S., Reynolds J. Learning Deterministic Finite Automata with aSmart State Labeling Algorithm // IEEE Transactions on Pattern Analysisand Machine Intelligence. 2005. Vol. 27. № 7, pp. 1063 – 1074.90. Lucas S. Evolving Finite-State Transducers: Some Initial Explorations.Lecture Notes in Computer Science. Springer Berlin / Heidelberg. Volume2610/2003, pp. 241 – 257. http://www.springerlink.com/content/41a34vg70fp1hltb/91. Mancoridis S., Mitchell B. S., Rorres C., Chen Y., Gansner E. R. UsingAutomatic Clustering to Produce High-Level System Organizations ofSource Code / Proceedings of the 6th International Workshop on ProgramComprehension (IWPC ’98), pp. 45 – 52.92. McMillan K. L. Symbolic model checking: an approach to the state explosionproblem. PhD thesis. SCS. Carnegie Mellon University, 1992.93. McMinn P. Search-Based Software Test Data Generation: A Survey// Software Testing, Verification and Reliability. 2004. Vol. 14.№ 2, pp. 105 – 156.94. Metropolis N., Rosenbluth A., Rosenbluth M., Teller A., Teller E. Equationof state calculations by fast computing machines. Journal of ChemicalPhysics. 1953. Vol. 21, pp. 1087 – 1092.95. Miller J. The Coevolution of Automata in the Repeated Prisoner'sDilemma. Working Paper. Santa Fe Institute. 1989 // Journal of EconomicBehavior & Organization. 1996. Vol. 29. Issue 1, pp. 87 – 112.