Some further remarks on the family of finite index matrix languages. (English) Zbl 0422.68036


68Q45 Formal languages and automata


Zbl 0411.68062
Full Text: EuDML


[1] 1. B. BRAINERD, An Analog of a Theorem About Context-Free Languages, Inform. Control., Vol. 11, 1968, pp.561-568. Zbl0184.02601 MR229488 · Zbl 0184.02601
[2] 2. J. FRIŠ, Grammars with Partial Or dering of Rules, Inform. Control., Vol. 12, 1968, pp. 415-425. Zbl0172.30002 MR243952 · Zbl 0172.30002
[3] 3. S. GINSBURG and S. A. GREIBACH, Abstract Families of Languages in Studies in Abstract Families of Languages, Mem. Amer. Math. Soc, Vol. 87, 1969. Zbl0194.31402 MR255329 · Zbl 0194.31402
[4] 4. O. MAYER, Some Restrictive Devices for Context-Free Grammars, Inform. Control., Vol. 20, 1972, pp. 69-92. Zbl0248.68035 MR359412 · Zbl 0248.68035
[5] 5. E. NAVRATIL, Context-Free Grammars with Regular Conditions, Kybernetika, Vol. 2, 1970, pp. 118-126. Zbl0208.02002 MR278861 · Zbl 0208.02002
[6] Gh. PĂUN, On the Index of Grammars and Languages, Inform. Control., Vol. 35, 1977, pp. 259-266. Zbl0363.68107 MR468357 · Zbl 0363.68107
[7] Gh. PĂUN, On the Generative Capacity of Simple Matrix Grammars of Finite Index, Inform. Processing Letters, Vol. 7, No. 2, 1978, pp. 100-102. Zbl0392.68059 MR475007 · Zbl 0392.68059
[8] 8. Gh. PĂUN, On the Family of Matrix Languages of Finite Index, to appear in J. Comput. System Sc. Zbl0411.68062 · Zbl 0411.68062
[9] 9. Gh. PĂUN, On the Generative Capacity of Conditional Grammars, to appear in Inform. Control. Zbl0429.68065 MR553695 · Zbl 0429.68065
[10] 10. Gh. PĂUN, On Szilard’s Languages Associated to a Matrix Grammar, to appear in Inform. Processing Letters. Zbl0398.68032 · Zbl 0398.68032
[11] 11. A. SALOMAA, Formal Languages, Academic Press, New York and London, 1973. Zbl0262.68025 MR438755 · Zbl 0262.68025
[12] A. P. J. VAN DER WALT, Rondom Context Grammars, Symp. on Formal Languages, Oberwolfach, Germany, 1970. · Zbl 0221.68047
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.