Hostname: page-component-848d4c4894-p2v8j Total loading time: 0 Render date: 2024-05-05T11:43:16.654Z Has data issue: false hasContentIssue false

A. V. Gladkij. Nékotoryé algoritmičéskié problémy dlá kontékstno-svobodnyh grammatik (Certain algorithmic problems for context-free grammars). Algébra i logika, Séminar, vol. 4 no. 1 (1965), pp. 3–13. - A. V. Gladkij. Algoritmičéskaá néraspoznavaémost′ suščéstvénnoj néoprédélénnosti kontékstno-svobodnyh ázykov (Algorithmic unsolvability of inherent ambiguity in context-free languages). Algébra i logika, Séminar, vol. 4 no. 4 (1965), pp. 53–63. - O. S. Kulagina. Ob odnom sposobé oprédéléniá grammatičéskih ponátij na bazé téorii množéstv (On a way of defining grammatical notions using set theory). Problémy kibérnétiki, vol. 1 (1958), pp. 203–214. - A. V. Gladku. Konfiguracionnyé haraktéristiki ázykov (Configuration characteristics of languages). Problémy kibérnétiki, vol. 10 (1963), pp. 251–260. - V. D. Lučkin. O rangah konfiguracij kontékstnosvobodnyh ázykov (On the ranks of configurations of context-free languages). Algébra i logika, Séminar, vol. 5 no. 3 (1966), pp. 59–70.

Published online by Cambridge University Press:  12 March 2014

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Copyright
Copyright © Association for Symbolic Logic 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)