7 search results - page 1 / 2 » Inductive Inference, DFAs, and Computational Complexity |
AII
1989
13 years 9 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
AGI
2008
13 years 7 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
ICGI
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
CEC
2003
IEEE
13 years 10 months ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
SEMCO
2007
IEEE
13 years 11 months ago
2007
IEEE
In this paper, we present an approach which, given a knowledge base and an appropriate text corpus, automatically induces patterns which can be used to query the knowledge base. W...