Learning regular languages from simple positive examples

DOI10.1023/A:1010826628977zbMath0983.68104OpenAlexW1508480967MaRDI QIDQ5945681

François Denis

Publication date: 21 April 2002

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010826628977

zbMATH Keywords

regular languagesgrammatical inference

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Natural language processing (68T50)

Related Items (4)

Meta-interpretive learning: application to grammatical inference ⋮ TeLEx: learning signal temporal logic from positive examples using tightness metric ⋮ PAC Learning under Helpful Distributions ⋮ Exploring learnability between exact and PAC

This page was built for publication: Learning regular languages from simple positive examples