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...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1992
|
| Sorozat: | Acta cybernetica
10 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12510 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 243-253 |
| ISSN: | 0324-721X |