1. Ya. M. Barzdin', ?Complexity of symmetry recognition on Turing machines,? in: Problems in Cybernetics [in Russian], No. 15, Nauka, Moscow (1965), pp. 245?248.
2. L. A. Bassalygo and E. V. Paducheva, ?Structural functionals of a context-free grammar and estimation of the complexity of a derivation,? Nauch.-Tekh. Inform. Sborn. Vsesoyuz. Inst. Nauch. i Tekh. Inform., Ser. 2, No. 2, 28?32 (1970).
3. M. I. Beletskii, ?Context-free and dominancy grammars and related algorithmic problems,? Kibernetika, No. 4, 90?97 (1967).
4. M. I. Beletskii, ?Strong equivalence of categorical and dominancy grammars,? Kibernetika, No. 3, 92?93 (1968).
5. M. I. Beletskii, ?On the various types of equivalence between dominancy grammars,? Kibernetika, No. 4, 91?95 (1968).