Inducing finite state machines from training samples using ant colony optimization
From MaRDI portal
Publication:2263894
DOI10.1134/S106423071402004XzbMath1308.93165OpenAlexW2131705732MaRDI QIDQ2263894
D. S. Chivilikhin, I. P. Buzhinsky, V. I. Ulyantsev, A. A. Shalyto
Publication date: 19 March 2015
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s106423071402004x
Application models in control theory (93C95) Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14)
Related Items (2)
The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ Modification of the method of generation of control finite-state machines with continuous actions based on training examples
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior
- A genetic algorithm for finding a salesman's route
- Method of reduced tables for generation of automata with a large number of input variables based on genetic programming
- Genetic algorithms: state of the art, problems, and perspectives
- Exact DFA Identification Using SAT Solvers
This page was built for publication: Inducing finite state machines from training samples using ant colony optimization