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 条
  • [1] BOUNDED PARIKH AUTOMATA
    Cadilhac, Michael
    Finkel, Alain
    Mckenzie, Pierre
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2012, 23 (08) : 1691 - 1709
  • [2] AFFINE PARIKH AUTOMATA
    Cadilhac, Michael
    Finkel, Alain
    McKenzie, Pierre
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2012, 46 (04): : 511 - 545
  • [3] Synchronization of Parikh Automata
    Hoffmann, Stefan
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2023, 2023, 13911 : 113 - 127
  • [4] The Algebraic Theory of Parikh Automata
    Cadilhac, Michael
    Krebs, Andreas
    McKenzie, Pierre
    THEORY OF COMPUTING SYSTEMS, 2018, 62 (05) : 1241 - 1268
  • [5] Parikh Image of Pushdown Automata
    Ganty, Pierre
    Gutierrez, Elena
    FUNDAMENTALS OF COMPUTATION THEORY, FCT 2017, 2017, 10472 : 271 - 283
  • [6] The Algebraic Theory of Parikh Automata
    Michaël Cadilhac
    Andreas Krebs
    Pierre McKenzie
    Theory of Computing Systems, 2018, 62 : 1241 - 1268
  • [7] Non-Global Parikh Tree Automata
    Herrmann, Luisa
    Osterholzer, Johannes
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2024, (407):
  • [8] Bounded arithmetic, proof complexity and two papers of Parikh
    Buss, SR
    ANNALS OF PURE AND APPLIED LOGIC, 1999, 96 (1-3) : 43 - 55
  • [9] Two-Way Parikh Automata with a Visibly Pushdown Stack
    Dartois, Luc
    Filiot, Emmanuel
    Talbot, Jean-Marc
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2019, 2019, 11425 : 189 - 206
  • [10] Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata
    Lavado, Giovanna J.
    Pighizzini, Giovanni
    Seki, Shinnosuke
    DEVELOPMENTS IN LANGUAGE THEORY (DLT 2012), 2012, 7410 : 284 - 295
12345