Pregrammars Versus Submonoids

Authors:
Jan Ostravský
Affiliations:
(Correspd.) Faculty of Technology Zlín, Technical University Brno, Nám. TGM 275 762 72 Zlín, Czech Republic
Venue:
Fundamenta Informaticae
Year:
1998

Citing 5
Cited 0

Formal languages

Formal languages
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
Reduction of Pregrammars

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Prelanguages and pregrammars introduced in [8] present a generalization of languages and pure grammars. Relation of domination and double domination may be easily transferred from languages to prelanguages. In the present paper submonoids of a commutative monoid are characterized by means of their relations of domination; subgroups of a commutative group are characterized by means of their relations of double domination. The submonoid generated by a subset of a commutative monoid is constructed using a suitable pregrammar.