![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
In this article a new class of grammars with derivation restrictions (similar to the matrix, conditional ones, etc.) is presented.
In this situation, if a rule of a subset peculiar to P is used in a derivation then it is compulsory to use only productions of that particular subset as long as it is possible.
According to the Chomsky hierarchy, naturally attributed to the grammars the generative power of the modular grammars is studied (Section 2), a series of results being obtained as well as a normal form similar to Chomsky's normal one.
The following two paragraphs deal with the closure properties—only for ℳ
2 and (proving that ℳ
2 is AFL) and also with decision problems connected with the modular grammars, using algorithmical proofs in general.