Pages that link to "Item:Q706625"
From MaRDI portal
The following pages link to Polynomial time learning of simple deterministic languages via queries and a representative sample (Q706625):
Displaying 6 items.
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- On polynomial-time learnability in the limit of strictly deterministic automata (Q1900980) (← links)
- A family of languages which is polynomial-time learnable from positive data in pitt's sense (Q2710786) (← links)
- Efficiency in the Identification in the Limit Learning Paradigm (Q2963593) (← links)
- Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher (Q3167310) (← links)
- Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries (Q3528418) (← links)
