An approach to the inference of finite state machines based on a gravitationally-inspired search algorithm

DOI10.3176/PROC.2013.1.05MaRDI QIDQ4917530zbMATH OpenOpenAlexFDO

Authors Margarita Spichakova

Publication date 30 April 2013

Published in Proceedings of the Estonian Academy of Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3176/proc.2013.1.05

zbMATH Keywords

finite state machinegravitational search algorithmsystem identification

Mathematics Subject Classification ID

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

Recommendations

• Limits of exact algorithms for inference of minimum size finite state machines
• FSM inference from long traces
• Inference of regular languages using state merging algorithms with search
• Inference of Finite-State Probabilistic Grammars
• Inducing finite state machines from training samples using ant colony optimization

Cited in

(3)

• A beam search algorithm for PFSA inference
• FSM inference from long traces
• Inducing finite state machines from training samples using ant colony optimization

Describes a project that uses

Uses Software

• BGSA

This page was built for publication: An approach to the inference of finite state machines based on a gravitationally-inspired search algorithm

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