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 |
| LEADER | 01215nab a2200253 i 4500 | ||
|---|---|---|---|
| 001 | acta12510 | ||
| 005 | 20220613091729.0 | ||
| 008 | 161015s1992 hu o 0|| eng d | ||
| 022 | |a 0324-721X | ||
| 040 | |a SZTE Egyetemi Kiadványok Repozitórium |b hun | ||
| 041 | |a eng | ||
| 100 | 1 | |a Dassow Jürgen | |
| 245 | 1 | 0 | |a Regularizing context-free languages by AFL operations |h [elektronikus dokumentum] : |b concatenation and Kleene closure / |c Dassow Jürgen |
| 260 | |c 1992 | ||
| 300 | |a 243-253 | ||
| 490 | 0 | |a Acta cybernetica |v 10 No. 4 | |
| 520 | 3 | |a 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. | |
| 650 | 4 | |a Természettudományok | |
| 650 | 4 | |a Számítás- és információtudomány | |
| 695 | |a Számítástechnika, Kibernetika | ||
| 700 | 0 | 1 | |a Mateescu Alexandru |e aut |
| 700 | 0 | 1 | |a Paun G. |e aut |
| 700 | 0 | 1 | |a Salomaa A. |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12510/1/cybernetica_010_numb_004_243-253.pdf |z Dokumentum-elérés |