FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA

DOI10.1142/S0129054196000221zbMath0867.68073MaRDI QIDQ3126016

Takashi Yokomori, Satoshi Kobayashi

Publication date: 7 August 1997

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

learnability; local parsability; noncounting languages

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68Q45: Formal languages and automata