Regularizing context-free languages by AFL operations: concatenation and Kleene closure

  J. Dassow A. Mateescu G. Paun A. Salomaa

Abstract:

  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" by concatenation with a regular set or by Kleene closure are investigated here: size, hierarchies, characterizations, closure, decidability.

 Gyenizse Pal 1996. Szeptember 4. Szerda 13:49:00 MET DST