<ul><li>Language learning refers to the problem of inferring a mathematical model which represents a formal language.</li><li>Existing language learning algorithms do not make use of prefix queries, which provide additional information about where parsing failed.</li><li>PL* is a novel language learning algorithm that uses prefix queries, improving efficiency and accuracy compared to the classical L* algorithm.</li><li>PL* can accurately learn a range of languages of practical interest in a more constrained setting with only prefix queries available.</li></ul>

Example-Free Learning of Regular Languages with Prefix Queries

Discover more