2-Head Pushdown Automata

被引：2
|
作者：
Samson, Awe Ayodeji [1 ]
机构：
[1] Eastern Mediterranean Univ, Dept Math, Mersin 10 Turkey, Famagusta, North Cyprus, Turkey
来源：
WORLD CONFERENCE ON TECHNOLOGY, INNOVATION AND ENTREPRENEURSHIP | 2015年
关键词：
2-Head Pushdown Automata; Non-Context-Free Languages; Deterministic 2-Head Pushdown Automata;
D O I：
10.1016/j.sbspro.2015.06.225
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
Finite state automata recognize regular languages which can be used in text processing, compilers, and hardware design. Two head finite automata accept linear context free languages. In addition, pushdown automata are able to recognize context free languages which can be used in programming languages and artificial intelligence. The finite automaton has deterministic and non-deterministic version likewise the two head finite automata and the pushdown automata. The deterministic version of these machines is such that there is no choice of move in any situation while the non-deterministic version has a choice of move. In this research the 2-head pushdown automata are described which is more powerful than the pushdown automata and it is able to recognize some non-context free languages as well. During this work, the main task is to characterize these machines. (C) 2015 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
引用
收藏
页码：2037 / 2046
页数：10
相关论文
共 50 条
  • [31] Synchronization of pushdown automata
    Caucal, Didier
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 120 - 132
  • [32] Blackhole Pushdown Automata
    Csuhaj-Varju, Erzsebet
    Masopust, Tomas
    Vaszil, Gyoergy
    FUNDAMENTA INFORMATICAE, 2011, 112 (2-3) : 137 - 156
  • [33] PUSHDOWN TREE AUTOMATA
    GUESSARIAN, I
    MATHEMATICAL SYSTEMS THEORY, 1983, 16 (04): : 237 - 263
  • [34] Deep pushdown automata
    Meduna, A
    ACTA INFORMATICA, 2006, 42 (8-9) : 541 - 552
  • [35] Pushdown automata, multiset automata, and Petri nets
    Hirshfeld, Y
    Moller, F
    THEORETICAL COMPUTER SCIENCE, 2001, 256 (1-2) : 3 - 21
  • [36] 2-HEAD 2IN HELICAL BROADCAST VTR.
    Ross, Philip
    Royal Television Society Journal, 1974, 15 (02): : 35 - 38
  • [37] ON THE 2-HEAD OF THE COLORED JONES POLYNOMIAL FOR PRETZEL KNOTS
    Beirne, Paul
    QUARTERLY JOURNAL OF MATHEMATICS, 2019, 70 (04): : 1353 - 1370
  • [38] String Suffix Automata and Subtree Pushdown Automata
    Janousek, Jan
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009, 2009, : 160 - 172
  • [39] Descriptional complexity of two-way pushdown automata with restricted head reversals
    Malcher, Andreas
    Mereghetti, Carlo
    Palano, Beatrice
    THEORETICAL COMPUTER SCIENCE, 2012, 449 : 119 - 133
  • [40] A Note on Pushdown Automata Systems
    Petersen, Holger
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 342 - 351
12345