Operators Reducing Generalized OL-Systems

Abstract

In [3], [4], I have investigated the so called special generalized grammars and their languages. A special generalized grammar is an ordered triple G = (V,S,R) where V is a finite set, S a subset of the free monoid V^X on V and R a subset of V^X×V^X. Let $$ denote the reflexive, transitive and stable closure of R in V^X. Then L(G) = {w; there is s ∈ S with the property $$} is the language generated by G. A special generalized grammar G = (V,S,R) is said to be a special grammar if the sets S, R are finite. A language is said to be grammatizable if it is generated by a special grammar.