Language representations starting from fully initial languages
It is proved that each regular/linear/context-free language is the image of a fully initial regular/linear/context-free language by an inverse homomorphism, as well as the intersection of two regular/linear/context-free fully initial languages, respectively. The converse of the latter assertion is n...
Elmentve itt :
Szerzők: | |
---|---|
Dokumentumtípus: | Cikk |
Megjelent: |
1991
|
Sorozat: | Acta cybernetica
10 No. 1-2 |
Kulcsszavak: | Számítástechnika, Kibernetika |
Tárgyszavak: | |
Online Access: | http://acta.bibl.u-szeged.hu/12494 |
LEADER | 01142nab a2200229 i 4500 | ||
---|---|---|---|
001 | acta12494 | ||
005 | 20220613084525.0 | ||
008 | 161015s1991 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 Păun Gheorghe | |
245 | 1 | 0 | |a Language representations starting from fully initial languages |h [elektronikus dokumentum] / |c Păun Gheorghe |
260 | |c 1991 | ||
300 | |a 65-70 | ||
490 | 0 | |a Acta cybernetica |v 10 No. 1-2 | |
520 | 3 | |a It is proved that each regular/linear/context-free language is the image of a fully initial regular/linear/context-free language by an inverse homomorphism, as well as the intersection of two regular/linear/context-free fully initial languages, respectively. The converse of the latter assertion is not true for linear and for context-free languages. | |
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 Vicolov Sorina |e aut |
856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12494/1/cybernetica_010_numb_001_002_065-070.pdf |z Dokumentum-elérés |