Learning finite cover automata from queries

DOI10.1016/J.JCSS.2011.04.002MaRDI QIDQ414872zbMATH OpenOpenAlexFDO

Authors Florentin Ipate

Publication date 11 May 2012

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2011.04.002

zbMATH Keywords

automata inferencedeterministic finite cover automatafinite automatalearning from queries

Mathematics Subject Classification ID

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

Recommendations

• Fundamental results for learning deterministic extended finite state machines from queries
• Polynomial inference of universal automata from membership and equivalence queries
• Minimal cover-automata for finite languages
• Implementation and Application of Automata
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

Cites work

• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• Automaticity. I: Properties of a measure of descriptional complexity
• Bounded sequence testing from deterministic finite state machines
• Bounded Sequence Testing from Non-deterministic Finite State Machines
• Domain-specific optimization in automata learning.
• scientific article; zbMATH DE number 590583 (Why is no real title available?)
• scientific article; zbMATH DE number 1008506 (Why is no real title available?)
• scientific article; zbMATH DE number 2080060 (Why is no real title available?)
• scientific article; zbMATH DE number 1773088 (Why is no real title available?)
• scientific article; zbMATH DE number 1452982 (Why is no real title available?)
• Incremental construction of minimal deterministic finite cover automata
• Inference of finite automata using homing sequences
• Language identification in the limit
• Learning regular sets from queries and counterexamples
• Minimal cover-automata for finite languages
• Uniform characterizations of non-uniform complexity measures

Cited in

(9)

• Automata techniques for query inference machines
• Fundamental results for learning deterministic extended finite state machines from queries
• Learning infinite-word automata with loop-index queries
• An intelligent approach for building a secure decentralized public key infrastructure in VANET
• A model learning based testing approach for spiking neural P systems
• scientific article; zbMATH DE number 1453046 (Why is no real title available?)
• RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• A model learning based testing approach for kernel P systems

This page was built for publication: Learning finite cover automata from queries

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