Special families of matrix languages and decidable problems
We investigate some variants of simple matrix grammars. It is proved that the equivalence problem, the inclusion problem and other problems are decidables for this families of grammars. It would be noted that all these problems are undecidable for the family of simple matrix grammars.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Published: |
1991
|
| Series: | Acta cybernetica
10 No. 1-2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12492 |
| LEADER | 01046nab a2200217 i 4500 | ||
|---|---|---|---|
| 001 | acta12492 | ||
| 005 | 20220613082136.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 Mateescu Alexandru | |
| 245 | 1 | 0 | |a Special families of matrix languages and decidable problems |h [elektronikus dokumentum] / |c Mateescu Alexandru |
| 260 | |c 1991 | ||
| 300 | |a 45-51 | ||
| 490 | 0 | |a Acta cybernetica |v 10 No. 1-2 | |
| 520 | 3 | |a We investigate some variants of simple matrix grammars. It is proved that the equivalence problem, the inclusion problem and other problems are decidables for this families of grammars. It would be noted that all these problems are undecidable for the family of simple matrix grammars. | |
| 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 | ||
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12492/1/cybernetica_010_numb_001_002_045-051.pdf |z Dokumentum-elérés |