Learning finite cover automata from queries
From MaRDI portal
Publication:414872
DOI10.1016/J.JCSS.2011.04.002zbMATH Open1332.68101OpenAlexW2171527505MaRDI QIDQ414872FDOQ414872
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
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 Complexity Gap for Two-Way Probabilistic Finite-State Automata
- Learning regular sets from queries and counterexamples
- Language identification in the limit
- Minimal cover-automata for finite languages
- Automaticity. I: Properties of a measure of descriptional complexity
- Inference of finite automata using homing sequences
- AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
- Bounded Sequence Testing from Non-deterministic Finite State Machines
- Uniform characterizations of non-uniform complexity measures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
- Computer Aided Verification
- Incremental construction of minimal deterministic finite cover automata
- Bounded sequence testing from deterministic finite state machines
Cited In (9)
- Title not available (Why is that?)
- Automata techniques for query inference machines
- 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 kernel P systems
- Learning Behaviors of Automata from Multiplicity and Equivalence Queries
- RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS
- A model learning based testing approach for spiking neural P systems
- Fundamental results for learning deterministic extended finite state machines from queries
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)
