FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA
From MaRDI portal
Publication:3126016
DOI10.1142/S0129054196000221zbMath0867.68073OpenAlexW1975715349MaRDI QIDQ3126016
Takashi Yokomori, Satoshi Kobayashi
Publication date: 7 August 1997
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054196000221
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items (1)
This page was built for publication: FAMILIES OF NONCOUNTING LANGUAGES AND THEIR LEARNABILITY FROM POSITIVE DATA