A hierarchy of language families learnable by regular language learning
From MaRDI portal
Publication:2506482
DOI10.1006/inco.1995.1163zbMath1096.68637MaRDI QIDQ2506482
Publication date: 10 October 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1163
Related Items
Learning strongly deterministic even linear languages from positive examples, A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages, Polynomial time learning of simple deterministic languages via queries and a representative sample, Recent advances of grammatical inference, Learning deterministic even linear languages from positive examples, Identification of function distinguishable languages., Even linear simple matrix languages: formal language properties and grammatical inference., Non-isometric Contextual Array Grammars with Regular Control and Local Selectors, Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries