Normal forms for phrase-structure grammars

Viliam Geffert

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1991)

  • Volume: 25, Issue: 5, page 473-496
  • ISSN: 0988-3754

How to cite

top

Geffert, Viliam. "Normal forms for phrase-structure grammars." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 25.5 (1991): 473-496. <http://eudml.org/doc/92402>.

@article{Geffert1991,
author = {Geffert, Viliam},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {normal forms},
language = {eng},
number = {5},
pages = {473-496},
publisher = {EDP-Sciences},
title = {Normal forms for phrase-structure grammars},
url = {http://eudml.org/doc/92402},
volume = {25},
year = {1991},
}

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
PB - EDP-Sciences
VL - 25
IS - 5
SP - 473
EP - 496
LA - eng
KW - normal forms
UR - http://eudml.org/doc/92402
ER -

References

top
  1. 1. V. GEFFERT, A Representation of Recursively Enumerable Languages by two Homomorphisms and a Quotient, Theoret. Comput. Sci., 1988, 62, pp. 235-249. Zbl0664.68075MR980932
  2. 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. Zbl0611.68050MR874614
  3. 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. Zbl0652.68095MR1023435
  4. 4. S. GINSBURG, Algebraic and Automata-Theoretic Properties of Formal Languages, North-Holland, Amsterdam, 1975. Zbl0325.68002MR443446
  5. 5. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, 1978. Zbl0411.68058MR526397
  6. 6. M. A. HARRISON and M. SCHOLNICK, A Grammatical Characterization of One Way Nondeterministic Stack Languages, Ibid., 1971, 18, pp. 148-172. Zbl0274.68020MR290902
  7. 7. J. E. HOPCROFT and J. D. ULLMAN, Formal Languages and Their Relation to Automata, Addison-Wesley, 1969. Zbl0196.01701MR237243
  8. 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. Zbl0695.68054MR1047742
  9. 9. E. POST, A Variant of a Recursively Unsolvable Problem, Bull. Amer. Math, Soc., 1946, 52, pp. 264-268. Zbl0063.06329MR15343
  10. 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. Zbl0491.68076MR652779
  11. 11. B. ROVAN, Complexity Classes of g-Systems are AFL, Univ. Comeniana, Acta Math. Univ. Comenian., XLVIII-XLIX, 1986, pp. 283-297. Zbl0639.68064MR885343
  12. 12. E. S. SANTOS, A Note on Bracketed Grammars, J. Assoc. Comput. Mach., 1972, 9, pp. 222-224. Zbl0238.68025MR449050
  13. 13. W. J. SAVITCH, How to Make Arbitrary Grammars Look Like Context-Free Grammars, S.I.A.M. J. Comput., 2, No. 3, 1973. Zbl0298.68057MR356596

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.