A note on the undecidability of contextfreeness

J. Albert

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

  • Volume: 16, Issue: 1, page 3-11
  • ISSN: 0988-3754

How to cite

top

Albert, J.. "A note on the undecidability of contextfreeness." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 16.1 (1982): 3-11. <http://eudml.org/doc/92152>.

@article{Albert1982,
author = {Albert, J.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {context-free languages; Post correspondence problem},
language = {eng},
number = {1},
pages = {3-11},
publisher = {EDP-Sciences},
title = {A note on the undecidability of contextfreeness},
url = {http://eudml.org/doc/92152},
volume = {16},
year = {1982},
}

TY - JOUR
AU - Albert, J.
TI - A note on the undecidability of contextfreeness
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1982
PB - EDP-Sciences
VL - 16
IS - 1
SP - 3
EP - 11
LA - eng
KW - context-free languages; Post correspondence problem
UR - http://eudml.org/doc/92152
ER -

References

top
  1. 1. A.V. AHO, Indexed Grammars - an Extension of Context - Free Grammars, J. Assoc. Comput. Mach., Vol. 15, 1968, pp. 647-671. Zbl0175.27801MR258547
  2. 2. J. ALBERT, Über indizierte und m-Block-indizierte Grammatiken, Ph. D. Thesis, Institut fur Angewandte Informatik und Formale Beschreibungsverfahren, Univ. Karlsruhe, 1976. 
  3. 3. J. ALBERT and L. WEGNER, Languages with Homomorphic Replacements, Theor. Comput. Sc., Vol. 16, 1981, pp. 291-305. Zbl0468.68085MR642323
  4. 4. P. ASVELD and J. ENGELFRIET, Iterated Deterministic Substitution, Acta Informatica, Vol. 8, 1977, pp. 285-302. Zbl0343.68034MR478764
  5. 5. J.-M. AUTEBERT, J. BEAUQUIER, L. BOASSON and M. LATTEUX, Indécidabilité de la condition IRS, Université de Lille I, publication n° 18.79, 1979. 
  6. 6. B. S. BAKER and R. V. BOOK, Reversal-Bounded Multipush-down Machines, J. Comput. System Sci., Vol. 8, 1974, pp. 315-332. Zbl0309.68043MR375844
  7. 7. Y. BAR-HILLEL, M. PERLES and E. SHAMIR, On Formal Properties of Simple Phrase-Structure Grammars, Z. f. Phonetik, Sprachwissenschaft, Kommunikations-forschung, Vol. 14, 1961, pp. 143-177. Zbl0106.34501MR151376
  8. 8. J. ENGELFRIET, E. MEINECHE SCHMIDT and J. VAN LEEUWEN, Stack Machines and Classes of Nonnested Macro Languages, J. Assoc. Comput. Mach., Vol.27, 1980, pp. 96-117. Zbl0428.68087MR554283
  9. 9. M. J. FISCHER, Grammars with Macro-like Productions, Ph. D. Thesis, Haryard Univ., Cambridge, Mass., 1968. 
  10. 10. S. GINSBURG and H. G. RICE, Two Families of Languages Related to ALGOL, J. Assoc. Comput. Mach., Vol. 9, 1962, pp. 350-371. Zbl0196.01803MR152158
  11. 11. S. GINSBURG, Formal Languages, North-Holland, Amsterdam, 1975. 
  12. 12. S. GREIBACH, A Note on Undecidable Properties of Formal Languages, Math. Systems Theory, Vol. 2, 1968, pp. 1-6. Zbl0157.01902MR225609
  13. 13. S. GREIBACH, An Infinite Hierarchy of Context-Free Languages, J. Assoc. Comput. Mach., Vol. 16, 1969, pp. 9-106. Zbl0182.02002MR238632
  14. 14. S. GREIBACH, Checking Automata andone-way Stack Languages, J. Comput. System Sc., Vol.3, 1969, pp. 196-217. Zbl0174.02702MR243953
  15. 15. S. GREIBACH, One Way Finite Visit Automata, Theor. Comput. Sc.,Vol. 6, 1978, pp. 175-221. Zbl0368.68059MR489039
  16. 16. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, Reading, Massachusetts, 1978. Zbl0411.68058MR526397
  17. 17. D. E. KNUTH, On the Translation of Languages from Left to Right, Information and Control, Vol. 8, 1965, pp. 607-635. Zbl0231.68027MR189942
  18. 18. M. LEVITINA, O nekotoryh grammatikah s pravilami globalnoi podstanovki, Akad. Nauk S.S.S.R. Nauchno-Tekhn. Inform., Ser. 2, 1973, pp. 32-36. Zbl0291.68024
  19. 19. M. LINNA, The DOL-Ness for Context-FreeLanguages is Decidable, Inf. Process. Letters, Vol. 5, 1976, pp. 149-151. Zbl0346.68033MR451889

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.