Learning subregular classes of languages with factored deterministic automata
From MaRDI portal
Publication:4599182
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
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)