Prelanguages Versus Submonoids

Authors:
Jan Ostravský
Affiliations:
-
Venue:
Fundamenta Informaticae
Year:
2001

Citing 6
Cited 0

Formal languages

Formal languages
Reduction of pregrammars

Fundamenta Informaticae - Special issue on grammar systems
Pregrammars Versus Submonoids

Fundamenta Informaticae
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [9] submonoids of a commutative monoid are characterized by means of their relations of domination, subgroups of a commutative monoid are characterized by means of their relations of double domination. The main purpose of this paper is to transfer these results to general monoids. The important means will be certain relations, which we shall study in detail.