Finite State Machine Synthesis for Evolutionary Hardware

2013/07/26 by Andrey Bereza, Bereza, Andrey, Maksim Lyashov +3
Computer Science · #Embedded Systems Design Techniques #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Neural and Evolutionary Computing (cs.NE)

paper · pdf · doi:10.48550/arxiv.1307.6995

openalex publication_date 2013/07/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This article considers application of genetic algorithms for finite machine synthesis. The resulting genetic finite state machines synthesis algorithm allows for creation of machines with less number of states and within shorter time. This makes it possible to use hardware-oriented genetic finite machines synthesis algorithm in autonomous systems on reconfigurable platforms.

Related

• Optimal Synthesis of Finite State Machines with Universal Gates using Evolutionary Algorithm
• Using Genetic Algorithm in the Evolutionary Design of Sequential Logic Circuits
• On the Synthesis of Finite-State Machines from Samples of Their Behavior
• Implementing Genetic Algorithms on Arduino Micro-Controllers
• GASP -- A Genetic Algorithm for State Preparation