Publication
A more bio-plausible approach to the evolutionary inference of finite state machines
AbstractWith resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies and metaphors to introduce an element of bio-plausibility to evolutionary grammatical inference. Inference of a finite-state machine that generalizes well over unseen input-output examples is an NP-complete problem. Heuristic algorithms exist to minimize the size of an FSM keeping it consistent with all the input-output sequences. However, their performance dramatically degrades in presence of noise in the training set. Evolutionary algorithms perform better for noisy data sets but they do not scale well and their performance drops as size or complexity of the target machine grows. Here, inspired by a biological perspective, an evolutionary algorithm with a novel representation and a new fitness function for inference of Moore finite-state machines of limited size is proposed and compared with one of the latest evolutionary techniques.
Download publicationAssociated Researchers
Related Resources
See what’s new.
2023
Flight of Innovation: How Drone Tech is Bridging Rural CommunitiesJoin this session at AU to learn about innovation in rural areas to…
2010
210 King Street: A Dataset for Integrated Performance AssessmentThis paper presents a Building Information Modeling (BIM) re-creation…
2015
Designing DEVS Visual Interfaces for End-User ProgrammersAlthough the Discrete EVent System specification (DEVS) has over…
2021
COVID-19 Facility Planning and Analysis: Designing a Multi-Agent Occupant Simulation SystemThe COVID-19 pandemic changed our lives, forcing us to reconsider our…
Get in touch
Something pique your interest? Get in touch if you’d like to learn more about Autodesk Research, our projects, people, and potential collaboration opportunities.
Contact us