State-Merging DFA Induction Algorithms with Mandatory Merge Constraints

DOI10.1007/978-3-540-88009-7_11MaRDI QIDQ3528414zbMATH OpenOpenAlexFDO

Authors

Publication date 16 October 2008

Published in Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88009-7_11

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Grammatical Inference: Algorithms and Applications
• Mergible states in large NFA
• Inference of regular languages using state merging algorithms with search
• Universal automata and NFA learning
• Learning automata teams

Cited in

(3)

• Inference of regular languages using state merging algorithms with search
• Grammatical Inference: Algorithms and Applications
• Induction and exploitation of subgoal automata for reinforcement learning

This page was built for publication: State-Merging DFA Induction Algorithms with Mandatory Merge Constraints

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