![Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5925/TOC-Subject-Sample-2021-Bioscience.jpg"})
Abstract
In this paper, we investigate the classical regulated rewriting mechanisms like programmed grammars, matrix grammars and ordered grammars considered as accepting devices, in contrast with the usual generating mode. Where in the type-n grammars of the Chomsky hierarchy the descriptive power both of generating and of accepting grammars coincide, this need not be true any more in regulated devices. We even obtain, e.g., that ordered grammars with context-free rules and γ-free productions accept all context- sensitive γ-free languages, and that ordered grammars with context-free rules, admitting γ-productions, are computationally universal in accepting mode.
