On derivation languages of a class of splicing systems
Derivation languages are language theoretical tools that describe halting derivation processes of a generating device. We consider two types of derivation languages, namely Szilard and control languages for splicing systems where iterated splicing is done in non-uniform way defined by Mitrana, Petre...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
University of Szeged, Institute of Informatics
Szeged
2018
|
| Sorozat: | Acta cybernetica
23 No. 4 |
| Kulcsszavak: | Számítástechnika, Programozás |
| Tárgyszavak: | |
| doi: | 10.14232/actacyb.23.4.2018.1 |
| Online Access: | http://acta.bibl.u-szeged.hu/58183 |
| Tartalmi kivonat: | Derivation languages are language theoretical tools that describe halting derivation processes of a generating device. We consider two types of derivation languages, namely Szilard and control languages for splicing systems where iterated splicing is done in non-uniform way defined by Mitrana, Petre and Rogojin in 2010. The families of Szilard (rules and labels are mapped in a one to one manner) and control (more than one rule can share the same label) languages generated by splicing systems of this type are then compared with the family of languages in the Chomsky hierarchy. We show that context-free languages can be generated as Szilard and control languages and any non-empty context-free language is a morphic image of the Szilard language of this type of system with finite set of rules and axioms. Moreover, we show that these systems with finite set of axioms and regular set of rules are capable of generating any recursively enumerable language as a control language. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 981-993 |
| ISSN: | 0324-721X |