Parikh Automata with Pushdown Stack

[1]  Pawel Urzyczyn,et al.  Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.

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

[3]  Peter C. Chapin.  Formal languages I , 1973, CSC '73.

[4]  Werner Damm,et al.  An Automata-Theoretic Characterization of the OI-Hierarchy , 1982, ICALP.

[5]  Tero Harju,et al.  Some Decision Problems Concerning Semilinearity and Commutation , 2002, J. Comput. Syst. Sci..

[6]  Véronique Bruyère,et al.  Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic , 2003, STACS.

[7]  Didier Caucal.  On Infinite Terms Having a Decidable Monadic Theory , 2002, MFCS.

[8]  Martin Leucker.  Prefix-Recognizable Graphs and Monadic Logic , 2001, Automata, Logics, and Infinite Games.

[9]  Joost Engelfriet,et al.  Iterated pushdown automata and complexity classes , 1983, STOC.

[10]  Arnaud Carayol,et al.  The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata , 2003, FSTTCS.

[11]  Andrei V. Kelarev.  On a class of functions computable by index grammars , 2004 .

[12]  Mark Weyer.  Decidability of S1S and S2S , 2001, Automata, Logics, and Infinite Games.

[13]  J. Berstel,et al.  Context-free languages , 1993, SIGA.

[14]  Hubert Comon-Lundh,et al.  Multiple Counters Automata, Safety Analysis and Presburger Arithmetic , 1998, CAV.

[15]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[16]  Denis Lugiez,et al.  XML schema, tree logic and sheaves automata , 2003, Applicable Algebra in Engineering, Communication and Computing.

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

[18]  Felix Christopher Klaedtke.  Automata-based decision procedures for weak arithmetics , 2004 .

[19]  Thomas Schwentick,et al.  Numerical document queries , 2003, PODS.

[20]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[21]  Wolfgang Thomas,et al.  A Short Introduction to Infinite Automata , 2001, Developments in Language Theory.

[22]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[23]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

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

[25]  S. Ginsburg,et al.  Semigroups, Presburger formulas, and languages. , 1966 .

[26]  Alfred V. Aho,et al.  Indexed Grammars—An Extension of Context-Free Grammars , 1967, SWAT.

[27]  Oscar H. Ibarra,et al.  Reachability Analysis for Some Models of Infinite-State Transition Systems , 2000, CONCUR.

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

[29]  C. Stirling.  Decidability of Bisimulation Equivalence for Pushdown Processes , 2000 .