Bounded Parikh Automata

被引：3
|
作者：
Cadilhac, Michael [1 ]
Finkel, Alain [2 ,3 ]
McKenzie, Pierre [1 ]
机构：
[1] Univ Montreal, DIRO, Montreal, PQ, Canada
[2] LSV ENS, Cachan, France
[3] CNRS, Paris, France
来源：
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE | 2011年 / 63期
关键词：
D O I：
10.4204/EPTCS.63.13
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Ruess [18]. Here, by means of related models, it is shown that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this class of languages is the class of bounded languages whose set of iterations is semilinear.
引用
收藏
页码：93 / 102
页数：10
相关论文
共 50 条
  • [41] On Reachability for Hybrid Automata over Bounded Time
    Brihaye, Thomas
    Doyen, Laurent
    Geeraerts, Gilles
    Ouaknine, Joel
    Raskin, Jean-Francois
    Worrell, James
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT II, 2011, 6756 : 416 - 427
  • [42] ALTERNATION BOUNDED AUXILIARY PUSHDOWN-AUTOMATA
    LADNER, RE
    STOCKMEYER, LJ
    LIPTON, RJ
    INFORMATION AND CONTROL, 1984, 62 (2-3): : 93 - 108
  • [43] On the power of bounded concurrency I: Finite automata
    Drusinsky, Doron, 1600, Publ by ACM, New York, NY, United States (41):
  • [44] REAL-TIME EQUIVALENCE OF CELLULAR AUTOMATA AND LINEAR-BOUNDED AUTOMATA
    MILGRAM, DL
    INFORMATION SCIENCES, 1976, 11 (03) : 251 - 255
  • [45] Verification of Bounded Discrete Horizon Hybrid Automata
    Vladimerou, Vladimeros
    Prabhakar, Pavithra
    Viswanathan, Mahesh
    Dullerud, Geir
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2012, 57 (06) : 1445 - 1455
  • [46] Efficient Bounded Reachability Computation for Rectangular Automata
    Chen, Xin
    Abraham, Erika
    Frehse, Goran
    REACHABILITY PROBLEMS, 2011, 6945 : 139 - +
  • [47] Bounded Model Checking for Parametric Timed Automata
    Knapik, Michal
    Penczek, Wojciech
    TRANSACTIONS ON PETRI NETS AND OTHER MODELS OF CONCURRENCY V, 2012, 6900 : 141 - 159
  • [48] Automata with Reversal-Bounded Counters: A Survey
    Ibarra, Oscar H.
    DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2014, 2014, 8614 : 5 - 22
  • [49] ONE-WAY BOUNDED CELLULAR AUTOMATA
    DYER, CR
    INFORMATION AND CONTROL, 1980, 44 (03): : 261 - 281
  • [50] BOUNDED QUANTIFICATION AND RELATIONS RECOGNIZABLE BY FINITE AUTOMATA
    LAURINOLLI, T
    ACTA INFORMATICA, 1978, 10 (01) : 67 - 78
12345