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 条
  • [31] On the Density of Context-Free and Counter Languages
    Eremondi, Joey
    Ibarra, Oscar H.
    McQuillan, Ian
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2018, 29 (02) : 233 - 250
  • [32] CONTEXT-FREE COMPLEXITY OF FINITE LANGUAGES
    BUCHER, W
    MAURER, HA
    CULIK, K
    THEORETICAL COMPUTER SCIENCE, 1984, 28 (03) : 277 - 285
  • [33] Context-free grammars and XML languages
    Bertoni, Alberto
    Choffrut, Christian
    Palano, Beatrice
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 108 - 119
  • [34] AN INTERCHANGE LEMMA FOR CONTEXT-FREE LANGUAGES
    OGDEN, W
    ROSS, RJ
    WINKLMANN, K
    SIAM JOURNAL ON COMPUTING, 1985, 14 (02) : 410 - 415
  • [35] Forgetting automata and context-free languages
    Acta Inf, 5 (409):
  • [36] ON THE DEGREE OF NONREGULARITY OF CONTEXT-FREE LANGUAGES
    DASSOW, J
    PAUN, G
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 36 (1-2) : 13 - 29
  • [37] The growth function of context-free languages
    Incitti, R
    THEORETICAL COMPUTER SCIENCE, 2001, 255 (1-2) : 601 - 605
  • [38] Immunity and pseudorandomness of context-free languages
    Yamakami, Tomoyuki
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (45) : 6432 - 6450
  • [39] The Context-Free Grammars of Artificial Languages
    Gribova, V. V.
    Kleschev, A. S.
    Krylov, D. A.
    AUTOMATIC DOCUMENTATION AND MATHEMATICAL LINGUISTICS, 2013, 47 (02) : 59 - 67
  • [40] On the Density of Context-Free and Counter Languages
    Eremondi, Joey
    Ibarra, Oscar H.
    McQuillan, Ian
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015), 2015, 9168 : 228 - 239
12345