Grammars working on layered strings
We consider first an operation with strings and languages suggested by superposed windows on the computer screen (as well as by cryptographic systems of Richelieu type): we assume that the strings contain usual symbols as well as a transparent symbol. Superposing two strings (justified to left), we...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1998
|
| Sorozat: | Acta cybernetica
13 No. 4 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12595 |
| LEADER | 01868nab a2200253 i 4500 | ||
|---|---|---|---|
| 001 | acta12595 | ||
| 005 | 20220613153212.0 | ||
| 008 | 161015s1998 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 Bottoni Paolo | |
| 245 | 1 | 0 | |a Grammars working on layered strings |h [elektronikus dokumentum] / |c Bottoni Paolo |
| 260 | |c 1998 | ||
| 300 | |a 339-358 | ||
| 490 | 0 | |a Acta cybernetica |v 13 No. 4 | |
| 520 | 3 | |a We consider first an operation with strings and languages suggested by superposed windows on the computer screen (as well as by cryptographic systems of Richelieu type): we assume that the strings contain usual symbols as well as a transparent symbol. Superposing two strings (justified to left), we produce a new string consisting of the symbols observable from above. This operation is investigated as an abstract operation on strings, then it is used in building a variant of grammar systems with the component grammars working on the layers of an array of strings. Each grammar can rewrite only symbols in its layer which are observable from above. The language generated in this way consists of strings of the observable symbols, produced at the end of a derivation. The power of several variants of these generative mechanisms is investigated for the case of two layered strings. When a matrix-like control on the work of the component grammars is considered, then a characterization of recursively enumerable languages is obtained. | |
| 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 Mauri Giancarlo |e aut |
| 700 | 0 | 1 | |a Mussio Piero |e aut |
| 700 | 0 | 1 | |a Păun Gheorghe |e aut |
| 856 | 4 | 0 | |u http://acta.bibl.u-szeged.hu/12595/1/cybernetica_013_numb_004_339-358.pdf |z Dokumentum-elérés |