Pages that link to "Item:Q3520065"

The following pages link to Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries (Q3520065):

Displayed 3 items.

• One-shot learners using negative counterexamples and nearest positive examples (Q1029327) ‎ (← links)
• A Note on the Relationship between Different Types of Correction Queries (Q3528420) ‎ (← links)
• Identification in the Limit of k,l-Substitutable Context-Free Languages (Q3528426) ‎ (← links)