Reduction of Pregrammars

Authors:
Miroslav Novotný
Affiliations:
Faculty of Computer Science, Masaryk University, Botanická 68a, 602 00 Brno, Czech Republic
Venue:
Fundamenta Informaticae
Year:
1998

Citing 6
Cited 1

Formal languages

Formal languages
Reducts versus reducing operators

Mathematical aspects of natural and formal languages
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Grammars and Languages

Formal Grammars and Languages
Automata, Languages, and Machines

Automata, Languages, and Machines
Formal languages and their relation to automata

Formal languages and their relation to automata

Pregrammars Versus Submonoids

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [13] pure generalized grammars were studied, in particular, the problem of reducing a pure generalized grammar to a pure grammar. These results are transferred to the so called pregrammars in the present paper. The obtained results may be applied not only to pure generalized grammars but also to other structures.