On k#$-Rewriting Systems
Views: 127
Author : Zbynek Krivka
Affiliation : Brno University of Technology, Faculty of Information Technology, Centre of Excellence IT4Innovations, Boˇzetˇechova 2, 612 66 Brno, Czech Republic
Country : Brno
Category : Computer Science & Information Technology
Volume, Issue, Month, Year : 21, 3, November, 2018
Abstract :
This paper introduces k#$-rewriting systems based on earlier defined #-rewriting systems but with additional pushdown memory. It demonstrates that these systems characterize an infinite hierarchy of language families resulting
from the limited number of rewriting positions in every configuration during the generation of a sentence.
Keyword : k#$-rewriting systems, pushdown, #-rewriting systems, infinite hierarchy, finite index, n-limited state grammars
Journal/ Proceedings Name : ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY
URL : http://www.romjist.ro/full-texts/paper600.pdf
User Name : alex
Posted 11-02-2020 on 16:12:55 AEDT
Related Research Work
- An Adaptive And Smart System For Parental Control On Digital Games
- Intelligent System For Solving Problems Of Veterinary Medicine On The Example Of Dairy Farms
- A Diet Control And Fitness Assistant Application Using Deep Learning-based Image Classification
- 2d Image Features Detector And Descriptor Selection Expert System