Inductive inference of formal languages from positive data
Reads0
Chats0
TLDR
A theorem characterizing when an indexed family of nonempty recursive formal languages is inferrable from positive data is proved, and other useful conditions for inference frompositive data are obtained.Abstract:
We consider inductive inference of formal languages, as defined by Gold (1967) , in the case of positive data, i.e., when the examples of a given formal language are successive elements of some arbitrary enumeration of the elements of the language. We prove a theorem characterizing when an indexed family of nonempty recursive formal languages is inferrable from positive data. From this theorem we obtain other useful conditions for inference from positive data, and give several examples of their application. We give counterexamples to two variants of the characterizing condition, and investigate conditions for inference from positive data that avoids “overgeneralization.”read more
Citations
More filters
Journal ArticleDOI
Discovering models of software processes from event-based data
Jonathan Cook,Alexander L. Wolf +1 more
TL;DR: In this article, the authors describe a Markov method for process discovery, as well as two additional methods that are adopted from other domains and augmented for their purposes, and compare the methods and discuss their application in an industrial case study.
Journal ArticleDOI
Inductive Inference: Theory and Methods
Dana Angluin,Carl Smith +1 more
TL;DR: This survey highlights and explains the main ideas that have been developed in the study of inductive inference, with special emphasis on the relations between the general theory and the specific algorithms and implementations.
Journal ArticleDOI
Finding patterns common to a set of strings
TL;DR: The main result is a polynomial-time algorithm for the special case of patterns containing only one variable symbol (possibly occurring several times in the pattern).
Book
Learnability in Optimality Theory
Bruce Tesar,Paul Smolensky +1 more
TL;DR: It is argued that Optimality Theory promotes confluence of the demands of more effective learnability and deeper linguistic explanation, as well as other learning issues, which allow efficient convergence to a correct grammar.
BookDOI
The handbook of contemporary syntactic theory
Mark Baltin,Chris Collins +1 more
TL;DR: This work explains Morphosyntactic Competition, the Structure of DPs, and the Natures of Nonconfigurationality in Modern Transformational Syntax, as well as investigating the role of rhetoric in the development of knowledge representation.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Journal ArticleDOI
Theory of Recursive Functions and Effective Computability.
Solomon Feferman,Hartley Rogers +1 more
TL;DR: Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.
Journal ArticleDOI
Language identification in the limit
TL;DR: It was found that theclass of context-sensitive languages is learnable from an informant, but that not even the class of regular languages is learningable from a text.
Journal ArticleDOI
A Formal Theory of Inductive Inference. Part II
TL;DR: Four ostensibly different theoretical models of induction are presented, in which the problem dealt with is the extrapolation of a very long sequence of symbols—presumably containing all of the information to be used in the induction.
Journal ArticleDOI
Complexity of automaton identification from given data
TL;DR: The question of whether there is an automaton with n states which agrees with a finite set D of data is shown to be NP-complete, although identification-in-the-limit of finite automata is possible in polynomial time as a function of the size of D.