Unambiguous automata inference by means of state-merging methods.

DOI10.1007/B13633MaRDI QIDQ5897337zbMATHOpenAlexFDO

Authors François Coste, Daniel C. Fredouille

Publication date 23 February 2010

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

Full work available at URL https://doi.org/10.1007/b13633

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1670710
• On the Inference of Finite State Automata from Positive and Negative Data
• Learning Regular Languages Using Nondeterministic Finite Automata
• A Family of Algorithms for Non Deterministic Regular Languages Inference
• Polynomial inference of universal automata from membership and equivalence queries

Cited in

(6)

• Universal automata and NFA learning
• A new technique for reachability of states in concatenation automata
• Learning Stochastic Logical Automaton
• Learning algorithms
• Unambiguity in automata theory
• Active learning of nondeterministic finite state machines

Describes a project that uses

Uses Software

• RFSA

This page was built for publication: Unambiguous automata inference by means of state-merging methods.

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