Learning subregular classes of languages with factored deterministic automata

zbMATH Open1376.68073MaRDI QIDQ4599182FDOQ4599182

Authors:

Publication date: 18 December 2017

Full work available at URL: https://aclweb.org/anthology/W/W13/W13-3007.pdf

Recommendations

• Learning mildly context-sensitive languages with multidimensional substitutability from positive data
• scientific article; zbMATH DE number 2080921
• scientific article; zbMATH DE number 996379
• Learning automatic families of languages
• Efficient learning of multiple context-free languages with multidimensional substitutability from positive data

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32)

Cited In (5)

• Automatic learning of subclasses of pattern languages
• Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
• Aural pattern recognition experiments and the subregular hierarchy
• Structure sensitive tier projection: applications and formal properties
• The expressivity of autosegmental grammars

This page was built for publication: Learning subregular classes of languages with factored deterministic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599182)