Some remarks on state grammars and matrix grammars

Etsuro Moriya

研究成果: Article

8 引用 (Scopus)

抄録

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.

元の言語English
ページ(範囲)48-57
ページ数10
ジャーナルInformation and control
23
発行部数1
DOI
出版物ステータスPublished - 1973
外部発表Yes

Fingerprint

Grammar
Regular Sets
Homomorphic
Intersection
Restriction
Language
Context

ASJC Scopus subject areas

  • Engineering(all)

これを引用

Some remarks on state grammars and matrix grammars. / Moriya, Etsuro.

:: Information and control, 巻 23, 番号 1, 1973, p. 48-57.

研究成果: Article

Moriya, Etsuro. / Some remarks on state grammars and matrix grammars. :: Information and control. 1973 ; 巻 23, 番号 1. pp. 48-57.
@article{c0cfa242de2c4ca99379b5b29110ea49,
title = "Some remarks on state grammars and matrix grammars",
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.",
author = "Etsuro Moriya",
year = "1973",
doi = "10.1016/S0019-9958(73)90884-X",
language = "English",
volume = "23",
pages = "48--57",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",
number = "1",

}

TY - JOUR

T1 - Some remarks on state grammars and matrix grammars

AU - Moriya, Etsuro

PY - 1973

Y1 - 1973

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0015655081&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0015655081&partnerID=8YFLogxK

U2 - 10.1016/S0019-9958(73)90884-X

DO - 10.1016/S0019-9958(73)90884-X

M3 - Article

AN - SCOPUS:0015655081

VL - 23

SP - 48

EP - 57

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

IS - 1

ER -