Splinter: A generic framework for evolving modular finite state machines

DOI10.1007/978-3-540-28645-5_36MaRDI QIDQ5311220zbMATH OpenOpenAlexFDO

Authors Ricardo Nastas Acras, Silvia Regina Vergilio

Publication date 22 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100195

zbMATH Keywords

evolutionary programmingmodularity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior
• Solving partially observable problems by evolution and learning of finite state machines
• Evolutionary programming: an application to clustering
• An evolutionary algorithm for the synthesis of RAM-based FSMs
• Evolving finite state transducers: Some initial explorations

Cited in

(2)

• The use of evolutionary programming based on training examples for the generation of finite state machines for controlling objects with complex behavior
• Solving partially observable problems by evolution and learning of finite state machines

This page was built for publication: Splinter: A generic framework for evolving modular finite state machines

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