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