Journal ArticleDOI
Parallel communicating grammar systems with terminal transmission
TLDR
It is shown that PCGSTT whose component grammars are terminal distinguishable right-linear, a notion introduced by Radhakrishnan and Nagaraja in [33,34], are identifiable in the limit if certain data communication information is supplied in addition.Abstract:
We introduce a new variant of PC grammar systems, called PC grammar systems with terminal transmission, PCGSTT for short. We show that right-linear centralized PCGSTT have nice formal language theoretic properties: they are closed under gsm mappings (in particular, under intersection with regular sets and under homomorphisms) and union; a slight variant is, in addition, closed under concatenation and star; their power lies between that of n-parallel grammars introduced by Wood and that of matrix languages of index n, and their relation to equal matrix grammars of degree n is discussed. We show that membership for these language classes is complete for NL. In a second part of the paper, we discuss questions concerning grammatical inference of these systems. More precisely, we show that PCGSTT whose component grammars are terminal distinguishable right-linear, a notion introduced by Radhakrishnan and Nagaraja in [33,34], are identifiable in the limit if certain data communication information is supplied in addition.read more
Citations
More filters
Journal Article
Unbounded Petri net synthesis
TL;DR: This work addresses the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabelled Place-Transition nets whose sets of reachable markings may be infinite.
Journal ArticleDOI
Identification of function distinguishable languages
TL;DR: It is shown how appropriately chosen functions f which the authors call distinguishing can be used to make deterministic finite automata backward deterministic, which can be exploited to design regular language classes called f-distinguishable which are identifiable in the limit from positive samples.
Journal ArticleDOI
Parallel Grammars: A Phenomenology
Henning Fernau,Henning Fernau +1 more
TL;DR: The aim of this paper is to give prospective PhD students in the area hints at where to start a promising research; and to supplement earlier reference lists on parallel grammars, trying to cover recent papers as well as ``older'' papers which were somehow neglected in other reviews.
Book ChapterDOI
Unbounded Petri Net Synthesis
TL;DR: In this paper, the authors address the problem of deciding uniformly for graphs or languages of a given class whether they are generated by unlabeled Place-Transition nets whose sets of reachable markings may be infinite.
Journal Article
Multigenerative grammar systems and matrix grammars
Roman Lukás,Alexander Meduna +1 more
TL;DR: It is proved thatMultigenerative grammar systems based on cooperating context-free grammatical components that simultaneously generate their strings in a rule-controlled or nonterminal-controlled rewriting way are equivalent with the matrix grammars.
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
Efficiency of a Good But Not Linear Set Union Algorithm
TL;DR: It is shown that, if t(m, n) is seen as the maximum time reqmred by a sequence of m > n FINDs and n -- 1 intermixed UNIONs, then kima(m), n is shown to be related to a functional inverse of Ackermann's functmn and as very slow-growing.
Journal ArticleDOI
Inductive inference of formal languages from positive data
TL;DR: 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.
Journal ArticleDOI
Toward a mathematical theory of inductive inference
TL;DR: This paper investigates the theoretical capabilities and limitations of a computer to infer such sequences and design Turing machines that in principle are extremely powerful for this purpose and place upper bounds on the capabilities of machines that would do better.
Related Papers (5)
Closure properties of linear context-free tree languages with an application to optimality theory
Stephan Kepser,Uwe Mönnich +1 more