Abstract
The context-free matrix grammar and the state grammar without any restriction in applying productions are considered. It turned out that these grammars are equivalent in the generative power. Another type of state grammar called the state grammar with unconditional transfer is introduced, and it is shown that each context-free matrix language is a homomorphic image of the intersection of a state language with unconditional transfer and a regular set.
Original language | English |
---|---|
Pages (from-to) | 48-57 |
Number of pages | 10 |
Journal | Information and control |
Volume | 23 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1973 |
Externally published | Yes |
ASJC Scopus subject areas
- Engineering(all)