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

DOI10.1007/3-540-61863-5_34zbMATH Open1184.68293OpenAlexW1545777539MaRDI QIDQ3556979

Author name not available (Why is that?)

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

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

Related Items (4)

Lower bounds on the area of finite-state machines ⋮ On the Inference of Finite State Automata from Positive and Negative Data ⋮ Inference of regular languages using state merging algorithms with search ⋮ Efficient algorithms for the inference of minimum size DFAs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎
• Hyper-minimizing minimized deterministic finite state automata 👍 👎
• An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton 👍 👎
• Minimization of Incompletely Specified Sequential Machines 👍 👎
• Efficient algorithms for the inference of minimum size DFAs 👍 👎

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)