Generating grammars, recognition automata, and other facilities for the specification of languages are reviewed.The present survey covers research published on mathematical linguistics, for the most part from 1971 through 1973. Primary attention is given to work on the theory of formal grammars and accepting automata. As in the earlier survey [16], we disregard articles pertaining wholly to linguistic applications of grammar theory.As a rule, with the exception of three or four articles, references cited in [16] are not repeated in the present Literature Cited. Accordingly, when referring to the results of a particular author for whom no reference is given, it is understood that the appropriate source is often to be found in [16].Among the more recent books published on mathematical linguistics we cite first and foremost the monograph by Gladkii [14], which contains a penetrating discussion of the theory of formal grammars and affords the reader a well-rounded comprehension of the scope of this discipline. A high level of presentation of the theory of languages and automata is found in a book by Kain [170], which is designed primarily as a lecture course for the training of computer design specialists and progr am me r s.Our survey is divided into sections corresponding to definite areas of research. Space limitations prevent us from cross-referencing from one section to another and necessitates the presentation of certain concepts without formal definitions (this is particularly true in the case of standard terms or concepts described in the earlier survey [16]). w Fundamental ConceptsA grammar is understood to be an ordered quadruple F = (V, W, S, R), where V is a terminal alphabet, W is a nonterminal (auxiliary) alphabet, V A W = | S is an initial symbol, S~W, and R is a system of derivation rules. A particular type T is assigned to a grammar according to tlie form of the rules. A finite-automaton grammar is assigned type 3, a contextless* grammar type 2, and a context (context-* We use the term "contextless" to designate what are called e-free context-free (CF) grammars in the non-Soviet literature.