Bounded Parikh Automata

The Parikh finite word automaton model (PA) was introduced and studied by Klaedtke and Rues. Here, we present some expressiveness properties of a restriction of the deterministic affine PA recently introduced, and use them as a tool to show that the bounded languages recognized by PA are the same as those recognized by deterministic PA. Moreover, this class of languages is shown equal to the class of bounded languages with a semilinear iteration set.

[1]  Oscar H. Ibarra,et al.  Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.

[2]  S. Ginsburg,et al.  Bounded -like languages , 1964 .

[3]  Felix Klaedtke,et al.  Monadic Second-Order Logics with Cardinalities , 2003, ICALP.

[4]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[5]  Valentin Goranko,et al.  Model-checking CTL* over flat Presburger counter systems , 2010, J. Appl. Non Class. Logics.

[6]  Alain Finkel,et al.  Well-abstracted transition systems: application to FIFO automata , 2003, Inf. Comput..

[7]  Ahmed Bouajjani,et al.  Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations , 1999, Theor. Comput. Sci..

[8]  Nissim Francez,et al.  Finite-Memory Automata , 1994, Theor. Comput. Sci..

[9]  Rohit Parikh,et al.  On Context-Free Languages , 1966, JACM.

[10]  Mikolaj Bojanczyk.  Weak MSO with the Unbounding Quantifier , 2009, STACS.

[11]  Oscar H. Ibarra,et al.  A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries , 1999, J. Comput. Syst. Sci..

[12]  Oscar H. Ibarra,et al.  Binary Reachability Analysis of Discrete Pushdown Timed Automata , 2000, CAV.

[13]  Fred B. Schneider,et al.  Verifying Safety Properties Using Non-deterministic Infinite-state Automata , 1989 .

[14]  Philippe Schnoebelen,et al.  Flat Acceleration in Symbolic Model Checking , 2005, ATVA.

[15]  S. Ginsburg,et al.  BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[16]  Michaël Cadilhac,et al.  On the Expressiveness of Parikh Automata and Related Models , 2011, NCMA.

[17]  R. Alur,et al.  Adding nesting structure to words , 2006, JACM.

[18]  Flavio D'Alessandro,et al.  On the Growth of Context-Free Languages , 2008, J. Autom. Lang. Comb..

[19]  Howard Straubing.  Finite Automata, Formal Logic, and Circuit Complexity , 1994, Progress in Theoretical Computer Science.

[20]  Patrick C. Fischer,et al.  Multi-tape and infinite-state automata—a survey , 1965, Commun. ACM.

[21]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[22]  L. P. Lisovik,et al.  Language recognition by two-way deterministic pushdown automata , 2004 .

[23]  Seymour Ginsburg,et al.  BOUNDED REGULAR SETS , 1966 .