On the Inference of Finite State Automata from Positive and Negative Data

DOI10.1007/978-3-662-48395-4_4zbMath1404.68061OpenAlexW2476138790MaRDI QIDQ2963595

Damián López, Pedro García

Publication date: 15 February 2017

Published in: Topics in Grammatical Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48395-4_4

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (1)

Dynamic shielding for reinforcement learning in black-box environments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial characteristic sets for \(DFA\) identification
• Universal automata and NFA learning
• Learning regular sets from queries and counterexamples
• Learning regular languages using RFSAs.
• Reducing NFAs by invariant equivalences.
• Polynomial-time identification of very simple grammars from positive data.
• Learning in varieties of the form \(\mathbf {V^{*}LI}\) from positive data
• Minimizing nfa's and regular expressions
• Inductive inference of formal languages from positive data
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• On the State Minimization of Nondeterministic Finite Automata
• Language identification in the limit
• MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON

This page was built for publication: On the Inference of Finite State Automata from Positive and Negative Data