Learning deterministic even linear languages from positive examples
From MaRDI portal
Publication:1390943
DOI10.1016/S0304-3975(97)00016-9zbMath0901.68159MaRDI QIDQ1390943
Yuji Takada, Takeshi Koshiba, Erkki Maekinen
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
68T05: Learning and adaptive systems in artificial intelligence
68Q45: Formal languages and automata
Related Items
On inferring linear single-tree languages, Pattern computation in neural communication systems, Even linear simple matrix languages: formal language properties and grammatical inference., TeLEx: learning signal temporal logic from positive examples using tightness metric
Cites Work
- Grammatical inference for even linear languages based on control sets
- A hierarchy of language families learnable by regular language learning
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Efficiency of a Good But Not Linear Set Union Algorithm
- On a family of linear grammars
- Language identification in the limit
- Unnamed Item
- Unnamed Item
- Unnamed Item