Application of genetic algorithms for automatic construction of finite-state automata in the problem of flibs

DOI10.1134/S1064230707050115zbMATH Open1308.90213MaRDI QIDQ2017496FDOQ2017496

Authors: P. G. Lobanov, A. A. Shalyto 

Publication date: 23 March 2015

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Recommendations

• Genetic algorithms: state of the art, problems, and perspectives
• Genetic algorithms -- an overview
• scientific article; zbMATH DE number 2222829
• scientific article; zbMATH DE number 1131224
• Unconventional Computation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Cellular automata (computational aspects) (68Q80)

Cites Work

• Title not available (Why is that?)
• Evolving cellular automata to perform computations: Mechanisms and impediments

Cited In (3)

• Method of reduced tables for generation of automata with a large number of input variables based on genetic programming
• Title not available (Why is that?)
• Genetic algorithms for the construction of initial identification sequences of cipher compositions

This page was built for publication: Application of genetic algorithms for automatic construction of finite-state automata in the problem of flibs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2017496)