论文信息 - Simple Matrix Languages with a Leftmost Restriction

Simple Matrix Languages with a Leftmost Restriction

It is shown that every type 1 language can be generated by an e-free simple matrix grammar (of order 2), if a certain leftmost restriction is imposed on the application of matrices. Dropping the e-free restriction, every type 0 language can be obtained. This strengthens a result previously established for matrix grammars.

Hermann A. Maurer

[1] John E. Hopcroft,et al. Scattered Context Grammars , 1969, J. Comput. Syst. Sci..

[2] Arto Salomaa,et al. Matrix Grammars with a Leftmost Restriction , 1972, Inf. Control..

[3] Takumi Kasai,et al. An Hierarchy Between Context-Free and Context-Sensitive Languages , 1970, J. Comput. Syst. Sci..

[4] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[5] Otto Mayer,et al. Some Restrictive Devices for Context-Free Grammars , 1972, Inf. Control..

[6] Arto Salomaa,et al. Periodically Time-Variant Context-Free Grammars , 1970, Inf. Control..

[7] Oscar H. Ibarra,et al. Simple Matrix Languages , 1970, Inf. Control..

[8] Daniel J. Rosenkrantz,et al. Programmed Grammars and Classes of Formal Languages , 1969, JACM.

[9] S. ABRAHAM,et al. SOME QUESTIONS OF PHRASE STRUCTURE GRAMMARS, I , 1967 .