A theory of formal synthesis via inductive learning

S Jha, SA Seshia - Acta Informatica, 2017 - Springer
Formal synthesis is the process of generating a program satisfying a high-level formal
specification. In recent times, effective formal synthesis methods have been proposed based …

Learning indexed families of recursive languages from positive data: a survey

S Lange, T Zeugmann, S Zilles - Theoretical Computer Science, 2008 - Elsevier
In the past 40 years, research on inductive inference has developed along different lines, eg,
in the formalizations used, and in the classes of target concepts considered. One common …

Discontinuities in pattern inference

D Reidenbach - Theoretical Computer Science, 2008 - Elsevier
This paper deals with the inferrability of classes of E-pattern languages–also referred to as
extended or erasing pattern languages–from positive data in Gold's model of identification in …

Flexfringe: Modeling software behavior by learning probabilistic automata

S Verwer, C Hammerschmidt - arxiv preprint arxiv:2203.16331, 2022 - arxiv.org
We present the efficient implementations of probabilistic deterministic finite automaton
learning methods available in FlexFringe. These implement well-known strategies for state …

Relations between Gold-style learning and query learning

S Lange, S Zilles - Information and Computation, 2005 - Elsevier
Different formal learning models address different aspects of human learning. Below we
compare Gold-style learning—modelling learning as a limiting process in which the learner …

A note on the relationship between different types of correction queries

C Tîrnăucă - … and Applications: 9th International Colloquium, ICGI …, 2008 - Springer
The adult-child interaction which takes place during the child's language acquisition process
has been the inspiration for Angluin's teacher-learner model [1], the forerunner of today's …

[PDF][PDF] Formal tree languages and their algorithmic learnability

A Kasprzik - 2012 - ubt.opus.hbz-nrw.de
This thesis centers on formal tree languages and on their learnability by algorithmic methods
in abstractions of several learning settings. After a general introduction (Chapter 1), we …

[書籍][B] Language learning with correction queries

C Tirnauca - 2009 - researchgate.net
I would not be here today if it was not for my dear friend and colleague Mihai Ionescu, who
persuaded me to continue my studies and to enroll in a PhD program in Tarragona. Also, I …

A characterization of the language classes learnable with correction queries

C Tîrnăucă, S Kobayashi - Theory and Applications of Models of …, 2007 - Springer
Formal language learning models have been widely investigated in the last four decades.
But it was not until recently that the model of learning from corrections was introduced. The …

[HTML][HTML] Robust learning of automatic classes of languages

S Jain, E Martin, F Stephan - Journal of Computer and System Sciences, 2014 - Elsevier
One of the most important paradigms in the inductive inference literature is that of robust
learning. This paper adapts and investigates the paradigm of robust learning to learning …