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 条
  • [31] Parikh Matrices and Parikh Rewriting Systems
    Teh, Wen Chean
    FUNDAMENTA INFORMATICAE, 2016, 146 (03) : 305 - 320
  • [32] Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
    Lavado, Giovanna J.
    Pighizzini, Giovanni
    Seki, Shinnosuke
    INFORMATION AND COMPUTATION, 2013, 228 : 1 - 15
  • [33] SPACE-BOUNDED PROBABILISTIC GAME AUTOMATA
    CONDON, A
    JOURNAL OF THE ACM, 1991, 38 (02) : 472 - 494
  • [34] ONLINE N-BOUNDED MULTICOUNTER AUTOMATA
    INOUE, K
    TAKANAMI, I
    INFORMATION SCIENCES, 1979, 17 (03) : 239 - 251
  • [35] CLASSES OF LANGUAGES + LINEAR-BOUNDED AUTOMATA
    KURODA, SY
    INFORMATION AND CONTROL, 1964, 7 (02): : 207 - &
  • [36] Alternating Timed Automata over Bounded Time
    Jenkins, Mark
    Ouaknine, Joel
    Rabinovich, Alexander
    Worrell, James
    25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010), 2010, : 60 - 69
  • [37] Amenability of bounded automata groups on infinite alphabets
    Reinke, Bernhard
    BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 2024, 56 (07) : 2460 - 2471
  • [38] Bounded Determinization of Timed Automata with Silent Transitions
    Lorber, Florian
    Rosenmann, Amnon
    Nickovic, Dejan
    Aichernig, Bernhard K.
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2015), 2015, 9268 : 288 - 304
  • [39] Improved Bounded Model Checking of Timed Automata
    Smith, Robert L.
    Bersani, Marcello M.
    Rossi, Matteo
    San Pietro, Pierluigi
    2021 IEEE/ACM 9TH INTERNATIONAL CONFERENCE ON FORMAL METHODS IN SOFTWARE ENGINEERING (FORMALISE 2021), 2021, : 97 - 110
  • [40] Deterministic synchronization of bounded-delay automata
    Frougny, C
    Sakarovitch, J
    THEORETICAL COMPUTER SCIENCE, 1998, 191 (1-2) : 61 - 77
12345