Abstract
The use of nonterminals versus the use of homomorphisms of different kinds in the basic types of deterministic OL-systems is studied. A rather surprising result is that in some cases the use of nonterminals produces a comparatively low generative capacity, whereas in some other cases the use of nonterminals gives a very high generative capacity. General results are obtained concerning the use of erasing productions versus the use of erasing homomorphisms. The paper contains a systematic classification of the effect of nonterminals, codings, weak codings, nonerasing homomorphisms and homomorphisms for all basic types of deterministic OL-languages, including table languages.
Original language | English |
---|---|
Journal | Acta Informatica |
Volume | 4 |
Issue | 1 |
Pages (from-to) | 87-106 |
ISSN | 0001-5903 |
DOIs | |
Publication status | Published - 1974 |