Book ChapterDOI
Learning a Subclass of Context-Free Languages
J. D. Emerald,K. G. Subramanian,D. G. Thomas +2 more
- pp 223-231
Reads0
Chats0
TLDR
Apical growth Pure context-free grammars (AGPCFG) which are a variation of the pure Grammars of Maurer et al are introduced which allow rewriting of active symbols at the ends of a string simultaneously.Abstract:
In this paper, Apical growth Pure context-free grammars (AGPCFG) which are a variation of the pure grammars of Maurer et al are introduced. These grammars allow rewriting of active symbols at the ends of a string simultaneously. They also provide a variation of another kind of grammars called filamentous systems with apical growth, which are motivated by biological considerations. The family of languages generated by AGPCFGs is a subclass of context-free languages. An algorithm for learning this language subclass, in the framework of identification in the limit from positive examples, is provided.read more
Citations
More filters
Journal ArticleDOI
LARS: A learning algorithm for rewriting systems
TL;DR: The authors introduced a new type of string rewriting systems called Delimited SRS (DSRS), which are expressive enough to define, in a uniform way, a noteworthy and non trivial class of languages that contains all the regular languages, including the parenthesis languages of Dyck, the language of Lukasiewicz and many others.
Book ChapterDOI
Learning Locally Testable Even Linear Languages from Positive Data
José M. Sempere,Pedro García +1 more
TL;DR: This work will use reduction techniques to define new classes of even linear languages which can be inferred from positive data only, and center their attention to inferable classes based on local testability features.
Proceedings ArticleDOI
Apical Growth Filamentous and Branching PC Grammar Systems
TL;DR: A model of a Parallel Communicating (PC) Grammar System is introduced and the branching structures and developmental sequences of microorganisms using this system are discussed.
References
More filters
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
Inference of Reversible Languages
TL;DR: An efficient algonthrn is presented for mfernng reversible languages from posmve and negative examples, and it is shown that it leads to correct identification m the hmlt of the class of reversible languages.
Journal ArticleDOI
Learning context-free grammars from structural data in polynomial time
TL;DR: In this paper, an efficient algorithm for learning context-free grammars using two types of queries, structural equivalence queries and structural membership queries, is presented. But it is not shown that a grammar learned by the algorithm is not only a correct grammar but also structurally equivalent to it.
Journal ArticleDOI
Using string languages to describe picture languages
TL;DR: This paper investigates the basic properties of pictures and picture description languages from the formal language theory point of view.
Journal ArticleDOI
On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata
TL;DR: This paper presents a learning algorithm that learns any SDA M in the limit from positive data, satisfying the properties that (i) the time for updating a conjecture is at most O(lm), and (ii) the number of implicit prediction errors is at least O(ln), where l is the maximum length of all positive data provided.