Dassow Jürgen and Mateescu Alexandru and Paun G. and Salomaa A.: Regularizing context-free languages by AFL operations : concatenation and Kleene closure. In: Acta cybernetica, (10) 4. pp. 243-253. (1992)
Preview |
Cikk, tanulmány, mű
cybernetica_010_numb_004_243-253.pdf Download (727kB) | Preview |
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'1 by concatenation with a regular set or by Kleene closure are investigated here: size, hierarchies, characterizations, closure, decidability.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1992 |
| Volume: | 10 |
| Number: | 4 |
| ISSN: | 0324-721X |
| Page Range: | pp. 243-253 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38495/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 252-253. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 13. 09:17 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12510 |
Actions (login required)
 |
View Item |
