A PAC learnability of simple deterministic languages
From MaRDI portal
Recommendations
- A polynomial time learning algorithm of simple deterministic languages via membership queries and a representative sample
- Polynomial time learning of simple deterministic languages via queries and a representative sample
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
- scientific article; zbMATH DE number 67617
- PAC learning with simple examples
Cited in
(10)- On the regularity and learnability of ordered DAG languages
- A polynomial time learning algorithm of simple deterministic languages via membership queries and a representative sample
- On the learnability of shuffle ideals
- On the learnability of shuffle ideals
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries
- PAC-Learning Unambiguous NTS Languages
- scientific article; zbMATH DE number 67617 (Why is no real title available?)
- Prediction-preserving reducibility with membership queries on formal languages
- scientific article; zbMATH DE number 6160572 (Why is no real title available?)
- Polynomial time learning of simple deterministic languages via queries and a representative sample
This page was built for publication: A PAC learnability of simple deterministic languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440403)