Prediction of binary sequences by evolving finite state machines

DOI10.1007/3-540-46033-0_4MaRDI QIDQ4736890zbMATH OpenFDO

Authors Umberto Cerruti, Mario Giacobini, Pierre Liardet

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2310/23100042.htm

Mathematics Subject Classification ID

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

Recommendations

• Universal prediction of individual sequences
• An unpredictability approach to finite-state randomness
• scientific article; zbMATH DE number 4135865
• PATTERN DEFINITION AND INFERENCE WITH STOCHASTIC PROCESSES
• ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS

Cited in

(5)

• Evolving finite-state machine strategies for protecting resources
• Evolving Turing machines for biosequence recognition and analysis
• Solving partially observable problems by evolution and learning of finite state machines
• ON DETERMINISTIC FINITE STATE MACHINES IN RANDOM ENVIRONMENTS
• Evolving cellular automata rules for multiple-step-ahead prediction of complex binary sequences

This page was built for publication: Prediction of binary sequences by evolving finite state machines

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