%D 1992
%O Bibliogr.: p. 252-253. ; ĂśsszefoglalĂĄs angol nyelven
%C Szeged
%L acta12510
%T Regularizing context-free languages by AFL operations : concatenation and Kleene closure
%V 10
%A  Dassow JĂźrgen
%A  Mateescu Alexandru
%A  Paun G.
%A  Salomaa A.
%K SzĂĄmĂ­tĂĄstechnika, Kibernetika
%N 4
%P 243-253
%J Acta cybernetica
%X We consider the possibility to obtain a regular language by applying a given operation to a context-free language. Properties of the family of context-free languages which can be "regularized'1 by concatenation with a regular set or by Kleene closure are investigated here: size, hierarchies, characterizations, closure, decidability.