Learning two-tape automata from queries and counterexamples
From MaRDI portal
Publication:4879209
Recommendations
Cites work
- A machine realization of the linear context-free languages
- Generalizations of regular events
- Grammatical inference for even linear languages based on control sets
- scientific article; zbMATH DE number 3976379 (Why is no real title available?)
- scientific article; zbMATH DE number 67637 (Why is no real title available?)
- scientific article; zbMATH DE number 3509706 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- Learning regular sets from queries and counterexamples
- On Relations Defined by Generalized Finite Automata
- Regular prefix relations
- Sets recognized by n-tape automata
- The theory of sequential relations
- When won't membership queries help?
Cited in
(7)- Some decisional problems on rational relations
- Even linear simple matrix languages: formal language properties and grammatical inference.
- Learning algorithms
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- Efficient learning of real time two-counter automata
- scientific article; zbMATH DE number 1301788 (Why is no real title available?)
- Automata Learning through Counterexample Guided Abstraction Refinement
This page was built for publication: Learning two-tape automata from queries and counterexamples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879209)