{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T09:56:09Z","timestamp":1648979769795},"reference-count":19,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1982]]},"DOI":"10.1051\/ita\/1982160100031","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:42:15Z","timestamp":1486395735000},"page":"3-11","source":"Crossref","is-referenced-by-count":1,"title":["A note on the undecidability of contextfreeness"],"prefix":"10.1051","volume":"16","author":[{"given":"J.","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. AHO A.V., Indexed Grammars - an Extension of Context - Free Grammars, J. Assoc. Comput. Mach., Vol. 15, 1968, pp. 647-671.2585470175.27801","DOI":"10.1145\/321479.321488"},{"key":"R2","unstructured":"2. ALBERT J., \u00dcber indizierte und m-Block-indizierte Grammatiken, Ph. D. Thesis, Institut fur Angewandte Informatik und Formale Beschreibungsverfahren, Univ. Karlsruhe, 1976."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. ALBERT J. and WEGNER L., Languages with Homomorphic Replacements, Theor. Comput. Sc., Vol. 16, 1981, pp. 291-305.6423230468.68085","DOI":"10.1016\/0304-3975(81)90100-6"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. ASVELD P. and ENGELFRIET J., Iterated Deterministic Substitution, Acta Informatica, Vol. 8, 1977, pp. 285-302.4787640343.68034","DOI":"10.1007\/BF00264471"},{"key":"R5","unstructured":"5. AUTEBERT J.-M., BEAUQUIER J., BOASSON L. and LATTEUX M., Ind\u00e9cidabilit\u00e9 de la condition IRS, Universit\u00e9 de Lille I, publication n\u00b0 18.79, 1979."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. BAKER B. S. and BOOK R. V., Reversal-Bounded Multipush-down Machines, J. Comput. System Sci., Vol. 8, 1974, pp. 315-332.3758440309.68043","DOI":"10.1016\/S0022-0000(74)80027-9"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. BAR-HILLEL Y., PERLES M. and SHAMIR E., On Formal Properties of Simple Phrase-Structure Grammars, Z. f. Phonetik, Sprachwissenschaft, Kommunikations-forschung, Vol. 14, 1961, pp. 143-177.1513760106.34501","DOI":"10.1524\/stuf.1961.14.14.143"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. ENGELFRIET J., MEINECHE SCHMIDT E. and VAN LEEUWEN J., Stack Machines and Classes of Nonnested Macro Languages, J. Assoc. Comput. Mach., Vol.27, 1980, pp. 96-117.5542830428.68087","DOI":"10.1145\/322169.322178"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. FISCHER M. J., Grammars with Macro-like Productions, Ph. D. Thesis, Haryard Univ., Cambridge, Mass., 1968.","DOI":"10.1109\/SWAT.1968.12"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. GINSBURG S. and RICE H. G., Two Families of Languages Related to ALGOL, J. Assoc. Comput. Mach., Vol. 9, 1962, pp. 350-371.1521580196.01803","DOI":"10.1145\/321127.321132"},{"key":"R11","unstructured":"11. GINSBURG S., Formal Languages, North-Holland, Amsterdam, 1975."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. GREIBACH S., A Note on Undecidable Properties of Formal Languages, Math. Systems Theory, Vol. 2, 1968, pp. 1-6.2256090157.01902","DOI":"10.1007\/BF01691341"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"13. GREIBACH S., An Infinite Hierarchy of Context-Free Languages, J. Assoc. Comput. Mach., Vol. 16, 1969, pp. 9-106.2386320182.02002","DOI":"10.1145\/321495.321503"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"14. GREIBACH S., Checking Automata andone-way Stack Languages, J. Comput. System Sc., Vol.3, 1969, pp. 196-217.2439530174.02702","DOI":"10.1016\/S0022-0000(69)80012-7"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. GREIBACH S., One Way Finite Visit Automata, Theor. Comput. Sc.,Vol. 6, 1978, pp. 175-221.4890390368.68059","DOI":"10.1016\/0304-3975(78)90035-X"},{"key":"R16","unstructured":"16. HARRISON M. A., Introduction to Formal Language Theory, Addison-Wesley, Reading, Massachusetts, 1978.5263970411.68058"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"17. KNUTH D. E., On the Translation of Languages from Left to Right, Information and Control, Vol. 8, 1965, pp. 607-635.1899420231.68027","DOI":"10.1016\/S0019-9958(65)90426-2"},{"key":"R18","unstructured":"18. LEVITINA M., O nekotoryh grammatikah s pravilami globalnoi podstanovki, Akad. Nauk S.S.S.R. Nauchno-Tekhn. Inform., Ser. 2, 1973, pp. 32-36.0291.68024"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"19. LINNA M., The DOL-Ness for Context-FreeLanguages is Decidable, Inf. Process. Letters, Vol. 5, 1976, pp. 149-151.4518890346.68033","DOI":"10.1016\/0020-0190(76)90062-4"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1982160100031\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:35:37Z","timestamp":1568799337000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1982160100031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"references-count":19,"journal-issue":{"issue":"1"},"alternative-id":["ita1982160100031"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1982160100031","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1982]]}}}