Normal forms for phrase-structure grammars
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 5, pp. 473-496. 
@article{ITA_1991__25_5_473_0,
     author = {Geffert, Viliam},
     title = {Normal forms for phrase-structure grammars},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {473--496},
     publisher = {EDP-Sciences},
     volume = {25},
     number = {5},
     year = {1991},
     mrnumber = {1144010},
     zbl = {0755.68092},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1991__25_5_473_0/}
}
TY  - JOUR
AU  - Geffert, Viliam
TI  - Normal forms for phrase-structure grammars
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1991
SP  - 473
EP  - 496
VL  - 25
IS  - 5
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1991__25_5_473_0/
LA  - en
ID  - ITA_1991__25_5_473_0
ER  - 
%0 Journal Article
%A Geffert, Viliam
%T Normal forms for phrase-structure grammars
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1991
%P 473-496
%V 25
%N 5
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1991__25_5_473_0/
%G en
%F ITA_1991__25_5_473_0
Geffert, Viliam. Normal forms for phrase-structure grammars. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) no. 5, pp. 473-496. http://www.numdam.org/item/ITA_1991__25_5_473_0/

1. V. Geffert, A Representation of Recursively Enumerable Languages by two Homomorphisms and a Quotient, Theoret. Comput. Sci., 1988, 62, pp. 235-249. | MR | Zbl

2. V. Geffert, Grammars with Context Dependency Restricted to Synchronization, Proc. of M.FC.S' 86, L.N.C.S., 1986, 233, Springer-Verlag, pp. 370-378. | MR | Zbl

3. V. Geffert, Context-Free-Like Forms for the Phrase-Structure Grammars, Proc. of M.F.C.S.' 88, L.N.C.S., 1988, 324, Springer-Verlag, pp. 309-317. | MR | Zbl

4. S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975. | MR | Zbl

5. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, 1978. | MR | Zbl

6. M. A. Harrison and M. Scholnick, A Grammatical Characterization of One Way Nondeterministic Stack Languages, Ibid., 1971, 18, pp. 148-172. | MR | Zbl

7. J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata, Addison-Wesley, 1969. | MR | Zbl

8. M. Jantzen, M. Kudlek, K. L. Lange and H. Petersen, Dyck1-Reductions of Context-Free Languages, Comput. Artificial Intelligence, 1990, 9, No. 1, pp. 3-18. | MR | Zbl

9. E. Post, A Variant of a Recursively Unsolvable Problem, Bull. Amer. Math, Soc., 1946, 52, pp. 264-268. | MR | Zbl

10. B. Rovan, A Framework for Studying Gramars, Proc. of M.F.C.S' 81, L.N.C.S., 1981, 118, Springer-Verlag, pp. 473-482. | MR | Zbl

11. B. Rovan, Complexity Classes of g-Systems are AFL, Univ. Comeniana, Acta Math. Univ. Comenian., XLVIII-XLIX, 1986, pp. 283-297. | MR | Zbl

12. E. S. Santos, A Note on Bracketed Grammars, J. Assoc. Comput. Mach., 1972, 9, pp. 222-224. | MR | Zbl

13. W. J. Savitch, How to Make Arbitrary Grammars Look Like Context-Free Grammars, S.I.A.M. J. Comput., 2, No. 3, 1973. | MR | Zbl