Limits of exact algorithms for inference of minimum size finite state machines

DOI10.1007/3-540-61863-5_34MaRDI QIDQ3556979zbMATH OpenOpenAlexFDO

Authors

Publication date 27 April 2010

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

Full work available at URL https://doi.org/10.1007/3-540-61863-5_34

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32)

Recommendations

• Efficient algorithms for the inference of minimum size DFAs
• A lower bound for probabilistic algorithms for finite state machines
• Lower bounds on the area of finite-state machines
• A heuristic algorithm for the minimization of incompletely specified finite state machines
• scientific article; zbMATH DE number 3414211
• Minimization of Incompletely Specified Sequential Machines
• Hyper-minimizing minimized deterministic finite state automata
• scientific article; zbMATH DE number 1213009
• An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
• scientific article; zbMATH DE number 6300100

Cited in

(8)

• scientific article; zbMATH DE number 4061424 (Why is no real title available?)
• FSM inference from long traces
• NEW METHODS FOR THE IDENTIFICATION OF FINITE STATE SYSTEMS
• On the Inference of Finite State Automata from Positive and Negative Data
• Efficient algorithms for the inference of minimum size DFAs
• Inference of regular languages using state merging algorithms with search
• An approach to the inference of finite state machines based on a gravitationally-inspired search algorithm
• Lower bounds on the area of finite-state machines

This page was built for publication: Limits of exact algorithms for inference of minimum size finite state machines

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