Graphical Representations of Context-Free Languages

被引：0
|
作者：
Nagy, Benedek [1 ]
机构：
[1] Eastern Mediterranean Univ, Famagusta, North Cyprus, Turkey
来源：
DIAGRAMMATIC REPRESENTATION AND INFERENCE, DIAGRAMS 2014 | 2014年 / 8578卷
关键词：
fractal automata; syntax diagrams; pushdown automata;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Regular languages can be represented by finite automata and by railroad diagrams. These two visual forms can be converted to each other. Context-free languages can also be described by (finite sets of) railroad diagrams. Based on the analogy we develop a new type of automata, the fractal automata: they accept the context-free languages. Relations between pushdown automata and fractal automata are also established.
引用
收藏
页码：48 / 50
页数：3
相关论文
共 50 条
12345