Identifying terminal distinguishable languages

DOI10.1023/B:AMAI.0000012869.49580.35zbMath1081.68035MaRDI QIDQ1430288

Henning Fernau

Publication date: 27 May 2004

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

formal languagesgrammatical inferenceeven linear languagesterminal distinguishability

Mathematics Subject Classification ID

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

Related Items (2)

Identification of function distinguishable languages. ⋮ Learning tree languages from text

This page was built for publication: Identifying terminal distinguishable languages