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

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, hierarchie...

Full description

Saved in:
Bibliographic Details
Main Authors: Dassow Jürgen
Mateescu Alexandru
Paun G.
Salomaa A.
Format: Article
Published: 1992
Series:Acta cybernetica 10 No. 4
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
Online Access:http://acta.bibl.u-szeged.hu/12510
Description
Summary: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.
Physical Description:243-253
ISSN:0324-721X