Learning of Elementary Formal Systems with Two Clauses Using QueriesAuthors: Hirotaka Kato, Satoshi Matsumoto, and Tetsuhiro Miyahara Source: Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 2005, Proceedings, (Sanjay Jain, Hans Ulrich Simon and Etsuji Tomita, Eds.), Lecture Notes in Artificial Intelligence 3734, pp. 211 - 225, Springer 2005.
Abstract.
An elementary formal system, EFS for short, is a kind of logic program over strings,
and regarded as a set of rules to generate a language. For an EFS Γ,
the language L(Γ) denotes the set of all strings
generated by Γ.
Many researchers studied the learnability of EFSs in various learning models.
In this paper, we introduce a subclass of EFSs, denoted by
We show that any EFS in
©Copyright 2005, Springer |