On polynomial-time learnability in the limit of strictly deterministic automata
From MaRDI portal
Publication:1900980
zbMath0831.68093MaRDI QIDQ1900980
Publication date: 13 February 1996
Published in: Machine Learning (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items
Polynomial-time identification of very simple grammars from positive data. ⋮ Recent advances of grammatical inference ⋮ Grammatical inference: An old and new paradigm ⋮ Efficiency in the Identification in the Limit Learning Paradigm ⋮ Learning Efficiency of Very Simple Grammars from Positive Data ⋮ Smoothing and compression with stochastic \(k\)-testable tree languages ⋮ Identification of birfsa languages. ⋮ The efficiency of identifying timed automata and the power of clocks ⋮ Learning efficiency of very simple grammars from positive data
