Previous |  Up |  Next

Article

References:
[1] G. Ciucar: On the syntactic complexity of Galiukschov semicontextual languages. Rev. Roumaine Lingv. CLTA 25 (1988), 1,23 - 28.
[2] J. Dassow: Pure grammars with regulated rewriting. Rev. Roumaine Math. Pures Appl. 31 (1986), 8, 657-666. MR 0872047 | Zbl 0617.68065
[3] J. Dassow, Gh. Páun: Regulated Rewriting in Formal Language Theory. Akademie Verlag, Berlin 1989. MR 1067543
[4] B. S. Galiukschov: Semicontextual grammars (in Russian). Mat. logica i mat. lingv. Kalinin Univ. 1981, 38-50.
[5] S. Marcus: Contextual grammars. Rev. Roumaine Math. Pures Appl. 14 (1969), 10, 1525 to 1534. MR 0262026 | Zbl 0193.32401
[6] Gh. Páun: On semicontextual grammars. Bull. Math. Soc. Sci. Math. R. S. Roumanie (N. S.) 28 (76) (1984), 1, 63-68. MR 0744752
[7] Gh. Páun: Two theorems about Galiukschov semicontextual languages. Kybernetika 21 (1985), 5,360-365. MR 0818888
[8] C.C.Squier: Semicontextual grammars: an example. Bull. Math. Sci. Math. R. S. Roumanie (N. S.) 32 (80) (1988), 2, 167-170. MR 0984174 | Zbl 0657.68077
Partner of
EuDML logo