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 条
  • [21] Synchronizing Bounded Partially Ordered Automata
    Cui Z.-H.
    He Y.
    Sun S.-Y.
    Jisuanji Xuebao/Chinese Journal of Computers, 2019, 42 (03): : 610 - 623
  • [22] Bounded-oscillation Pushdown Automata
    Ganty, Pierre
    Valput, Damir
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (226): : 178 - 197
  • [23] Bounded monotone recursion and multihead automata
    Marchenkov, S. S.
    PROGRAMMING AND COMPUTER SOFTWARE, 2013, 39 (06) : 301 - 308
  • [24] Visit-Bounded Stack Automata
    Jirasek, Jozef
    McQuillan, Ian
    THEORY OF COMPUTING SYSTEMS, 2023, 67 (05) : 956 - 975
  • [25] Bounded model checking for region automata
    Yu, F
    Wang, BY
    Huang, YW
    FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 246 - 262
  • [26] Visit-Bounded Stack Automata
    Jirasek, Jozef
    McQuillan, Ian
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2022), 2022, 13257 : 189 - 200
  • [27] Visit-Bounded Stack Automata
    Jozef Jirásek
    Ian McQuillan
    Theory of Computing Systems, 2023, 67 : 956 - 975
  • [28] AUTOMATA AND CODES WITH BOUNDED DECIPHERING DELAY
    BRUYERE, V
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 583 : 99 - 107
  • [29] Observability and reconstructibility of bounded cellular automata
    Plenet, Theo
    El Yacoubi, Samira
    Raievsky, Clement
    Lefevre, Laurent
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2022, 53 (14) : 2901 - 2917
  • [30] Bounded monotone recursion and multihead automata
    S. S. Marchenkov
    Programming and Computer Software, 2013, 39 : 301 - 308
12345