On a class of P automata

被引:4
|
作者
Madhu, M
Krithivasan, K [1 ]
机构
[1] Int Inst Informat Technol, Hyderabad 500019, Andhra Pradesh, India
[2] Indian Inst Technol, Theoret Comp Sci Lab, Dept Comp Sci & Engn, Madras 600036, Tamil Nadu, India
关键词
P systems; tissue P systems; one-way P automata; Parikh mapping; matrix grammar; recursively enumerable languages;
D O I
10.1080/0020716031000148502
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, we propose a class of P automata in which each membrane has a state, like in tissue P systems [5], and the computation starts at some initial state and ends in a final state. Unlike the automaton considered in [2], where rules are used in sequential manner, here we consider a variant such that the rules can be applied in maximal mode (as defined in tissue P systems), We show that P automata characterize the recursively enumerable sets of vectors of natural numbers.
引用
收藏
页码:1111 / 1120
页数:10
相关论文
共 50 条
  • [21] ARITHMETICAL PREDICATES ON A CLASS OF FINITE AUTOMATA
    OTTMANN, T
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1972, 19 (05): : A601 - &
  • [22] A New Class of ε-Optimal Learning Automata
    Jiang, Wen
    ADVANCED INTELLIGENT COMPUTING, 2011, 6838 : 116 - 121
  • [23] CLASS OF UNIVERSAL LINEAR BOUNDED AUTOMATA
    FELDMAN, ED
    OWINGS, JC
    INFORMATION SCIENCES, 1973, 6 (02) : 187 - 190
  • [24] Universality class of probabilistic cellular automata
    Makowiec, D
    Gnacinski, P
    CELLULAR AUTOMATA, PROCEEDINGS, 2002, 2493 : 104 - 113
  • [25] CLASS OF AUTOMATA MODELS OF LEARNING MACHINES
    LANGHOLZ, G
    INTERNATIONAL JOURNAL OF MAN-MACHINE STUDIES, 1972, 4 (02): : 119 - 127
  • [26] Speedup in searching for filtrons of a class of automata
    Siwak, PP
    7TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL XIII, PROCEEDINGS: SYSTEMICS, CYBERNETICS AND INFORMATICS: TECHNOLOGIES AND APPLICATIONS, 2003, : 85 - 90
  • [27] P AND dP AUTOMATA: UNCONVENTIONAL VERSUS CLASSICAL AUTOMATA
    Csuhaj-Varju, Erzsebet
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2013, 24 (07) : 995 - 1008
  • [28] P and dP Automata: Unconventional versus Classical Automata
    Csuhaj-Varju, Erzsebet
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 7 - 22
  • [29] Model Checking for a Class of Weighted Automata
    Peter Buchholz
    Peter Kemper
    Discrete Event Dynamic Systems, 2010, 20 : 103 - 137
  • [30] Model Checking for a Class of Weighted Automata
    Buchholz, Peter
    Kemper, Peter
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2010, 20 (01): : 103 - 137