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

177116. Tomita M. Dynamic construction of finite automata from examples usinghill climbing / Proceedings of the 4 th Annual Cognitive ScienceConference (USA, 1982), pp. 105 – 108.117. Tu M., Wolff E., Lamersdorf W. Genetic Algorithms for AutomatedNegotiations: A FSM-based Application Approach /Proceedings of the 11-th International Conference on Database and Expert Systems, 2000.http://ieeexplore.ieee.org/iel5/7035/18943/00875153.pdf118. Von Neumann J., Burks A. The Theory of Self-reproducing Automata.Urbana. Univ. of Illinois Press, 1966.119. Wegener J., Baresel A., Sthamer H. Evolutionary test environment for automaticstructural testing // Information and Software Technology SpecialIssue on Software Engineering using Metaheuristic Innovative Algorithms.2001. Vol. 43. Issue 14, pp. 841 – 854.120. Whitley D. The GENITOR Algorithm and Selective Pressure /Proceedings of the 3rd International Conference on Genetic Algorithms.Colorado State: Morgan Kaufmann. 1989, pp. 116 − 121.http://www.genalgo.com/index.php?option=com_content&task=view&id=80&Itemid=30121. Zhang Y., Finkelstein A., Harman M. Search-Based RequirementsOptimisation: Existing Work and Challenges / Proceedings ofInternationall Working Conference on Requirements Engineering:Foundation for Software Quality (REFSQ 08). LNCS 5025. Springer.2008, pp. 88 – 94.122. Zomorodian A. Context-free Language Induction by Evolution ofDeterministic Push-Down Automata Using Genetic Programming.http://www.cs.dartmouth.edu/~afra/papers/aaai96/aaai96.pdf