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

DOI10.1007/978-3-662-48395-4_4MaRDI QIDQ2963595zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
• Inferring pure context-free languages from positive data
• Algorithms for the inverse and a generalization of the state space approach to finite automata
• Diversity-based inference of finite automata
• Inference of finite automata using homing sequences
• Inferring uniquely terminating regular languages from positive data
• Inference of finite-state transducers from regular languages
• Inferring Symbolic Automata
• Limits of exact algorithms for inference of minimum size finite state machines

Cites work

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

Cited in

(8)

• Implementation and Application of Automata
• FSM inference from long traces
• Dynamic shielding for reinforcement learning in black-box environments
• Unambiguous automata inference by means of state-merging methods.
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
• scientific article; zbMATH DE number 1670717 (Why is no real title available?)
• A Family of Algorithms for Non Deterministic Regular Languages Inference
• Constructing deterministic parity automata from positive and negative examples

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

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