A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Regularizing Context-Free Languages by AFL Operations: Concatenation and Kleene Closure
1992
Acta Cybernetica
Preserved Fulltext
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.
dblp:journals/actaC/DassowMPS92
fatcat:p3n2g44dcjbo5kbnc53m2uruka