On some operators reducing generalized grammars
Reads0
Chats0
TLDR
The main result is that there exists a reducing operator δ with the following property: A special generalized grammar can be reduced to a special grammar by means of a reducing operators if and only if it can be reduction to aSpecial generalized grammar by Means of δ.Abstract:
Recursively enumerable languages can be constructed on the basis of grammatizable languages which are generated by the so-called special grammars. If certain finiteness conditions are omitted in the definition of a special grammar, a special generalized grammar is defined. Any language is generated by a special generalized grammar in a trivial way. Reducing operators are studied which assign a smaller special generalized grammar to each special generalized grammar in such a way that both generate the same language. The main result is that there exists a reducing operator δ with the following property: A special generalized grammar can be reduced to a special grammar by means of a reducing operator if and only if it can be reduced to a special grammar by means of δ .read more
Citations
More filters
Journal ArticleDOI
Limits of Pure Grammars with Monotone Productions
TL;DR: The grammatical inference problem is solved for a class of languages which can be generated by pure grammars with non-shortening productions and an algorithm for assigning a pure grammar to any language from the class is described.
Journal Article
Construction of Pure Grammars
TL;DR: A construction is described assigning a pure grammar G_{mrn} to any language and to any integers 0≤m≤r≤n, which has the following property: If the sequence (G{mrn})_{n≥r} has a limit G_{mr} for any r≥m, then the given language is generated by apure grammar.
Book ChapterDOI
Operators Reducing Generalized OL-Systems
TL;DR: In [3], [4], I have investigated the so called special generalized grammars and their languages.
Journal ArticleDOI
On a reducing operator for combinatorial systems
Manfred Kudlek,Miroslav Novotný +1 more
TL;DR: A reducing operator δ is defined assigning, to any generalized combinatorial system C, a generalized combinatorsial system δC in such a way that C,δC generate the same language and that δ C is, in a certain sense, smaller than or equal to C.
Journal ArticleDOI
Reduction of Pregrammars
TL;DR: The results are transferred to the so called pregrammars in the present paper and may be applied not only to pure generalized grammars but also to other structures.
References
More filters