Efficient Learning of Tier-Based Strictly k-Local Languages

DOI10.1007/978-3-319-53733-7_4zbMath1485.68122OpenAlexW2588623792MaRDI QIDQ5738987

Adam Jardine, Kevin McMullin

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53733-7_4

zbMATH Keywords

grammatical inferencealgorithmic learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

Relativized adjacency ⋮ The expressivity of autosegmental grammars

Cites Work

• Unnamed Item
• Aural pattern recognition experiments and the subregular hierarchy
• Characteristic sets for polynomial grammatical inference
• Cognitive and Sub-regular Complexity
• Language identification in the limit

This page was built for publication: Efficient Learning of Tier-Based Strictly k-Local Languages