Bottoni Paolo and Mauri Giancarlo and Mussio Piero and Păun Gheorghe: Grammars working on layered strings. In: Acta cybernetica, (13) 4. pp. 339-358. (1998)
Preview |
Cikk, tanulmány, mű
cybernetica_013_numb_004_339-358.pdf Download (911kB) | Preview |
Abstract
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1998 |
| Volume: | 13 |
| Number: | 4 |
| ISSN: | 0324-721X |
| Page Range: | pp. 339-358 |
| Language: | English |
| Place of Publication: | Szeged |
| Related URLs: | http://acta.bibl.u-szeged.hu/38506/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika |
| Additional Information: | Bibliogr.: p. 357-358. ; ö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. 15:32 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12595 |
Actions (login required)
 |
View Item |
