Automata with Reversal-Bounded Counters: A Survey

We survey the properties of automata augmented with reversal-bounded counters. In particular, we discuss the closure/non-closure properties of the languages accepted by these machines as well as the decidability/undecidability of decision problems concerning these devices. We also give applications to several problems in automata theory and formal languages.

[1]  Petr Hliněný,et al.  Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings , 2010, MFCS.

[2]  Tao Jiang,et al.  New Decidability Results Concerning Two-Way Counter Machines , 1995, SIAM J. Comput..

[3]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

[4]  Anthony Widjaja Lin,et al.  Model Checking Recursive Programs with Numeric Data Types , 2011, CAV.

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

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

[7]  Roberto Grossi,et al.  Mathematical Foundations Of Computer Science 2003 , 2003 .

[8]  Oscar H. Ibarra,et al.  Past Pushdown Timed Automata , 2001, CIAA.

[9]  Alain Finkel,et al.  Reachability in Timed Counter Systems , 2009, INFINITY.

[10]  Eitan M. Gurari,et al.  Two-Way Counter Machines and Diophantine Equations , 1982, JACM.

[11]  Ramesh Hariharan,et al.  FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science , 2001, Lecture Notes in Computer Science.

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

[13]  Thomas Schwentick,et al.  On the Complexity of Equational Horn Clauses , 2005, CADE.

[14]  Rajeev Alur.  Streaming String Transducers , 2011, WoLLIC.

[15]  Brenda S. Baker,et al.  Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..

[16]  Oscar H. Ibarra.  On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers , 2014, CIAA.

[17]  Timothy V. Griffiths.  The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines , 1968, JACM.

[18]  Oscar H. Ibarra,et al.  Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter , 2001, FSTTCS.

[19]  Oscar H. Ibarra,et al.  Characterizations of Catalytic Membrane Computing Systems , 2003, MFCS.

[20]  Oscar H. Ibarra,et al.  On two-way nondeterministic finite automata with one reversal-bounded counter , 2005, Theor. Comput. Sci..

[21]  Jean-François Raskin,et al.  Visibly Pushdown Transducers ⋆ , 2008 .

[22]  Oscar H. Ibarra,et al.  On the containment and equivalence problems for two-way transducers , 2012, Theor. Comput. Sci..

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

[24]  Zhe Dang,et al.  Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks , 2001, CAV.

[25]  Michaël Cadilhac,et al.  Unambiguous constrained Automata , 2013, Int. J. Found. Comput. Sci..

[26]  Rajeev Alur,et al.  Nondeterministic Streaming String Transducers , 2011, ICALP.

[27]  Mogens Nielsen,et al.  Mathematical Foundations of Computer Science 2000 , 2001, Lecture Notes in Computer Science.

[28]  Oscar H. Ibarra,et al.  The unsolvability of the equivalence problem for e-free NGSM's with unary input (output) alphabet and applications , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[29]  Pavol Cerný,et al.  Expressiveness of streaming string transducers , 2010, FSTTCS.

[30]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[31]  Oscar H. Ibarra,et al.  Dense Counter Machines and Verification Problems , 2003, CAV.

[32]  Andreas Weber,et al.  Decomposing Finite-Valued Transducers and Deciding Their Equivalence , 1993, SIAM J. Comput..

[33]  Klaus Wich.  Exponential ambiguity of context-free grammars , 1999, Developments in Language Theory.

[34]  Eitan M. Gurari,et al.  The Complexity of Decision Problems for Finite-Turn Multicounter Machines , 1981, J. Comput. Syst. Sci..

[35]  Graham Steel,et al.  Deduction with XOR Constraints in Security API Modelling , 2005, CADE.

[36]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[37]  Oscar H. Ibarra,et al.  Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines , 2012, Int. J. Found. Comput. Sci..

[38]  Seymour Ginsburg,et al.  Derivation-Bounded Languages , 1968, J. Comput. Syst. Sci..

[39]  S. J. Walljasper.  Left-Derivation Bounded Languages , 1974, J. Comput. Syst. Sci..

[40]  Oscar H. Ibarra,et al.  Conter Machines: Decidable Properties and Applications to Verification Problems , 2000, MFCS.

[41]  Alain Finkel,et al.  Dense-choice Counter Machines revisited , 2009, INFINITY.

[42]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[43]  Michaël Cadilhac,et al.  Affine Parikh automata , 2012, RAIRO Theor. Informatics Appl..

[44]  Jerzy Tyszkiewicz,et al.  Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings , 2008, MFCS.

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

[46]  Eitan M. Gurari,et al.  A note on finite-valued and finitely ambiguous transducers , 1983, Mathematical systems theory.

[47]  Eitan M. Gurari.  The Equivalence Problem for Deterministic Two-Way Sequential Transducers is Decidable , 1982, SIAM J. Comput..

[48]  Oscar H. Ibarra.  On Decidability and Closure Properties of Language Classes with Respect to Bio-operations , 2014, DNA.

[49]  Karel Culik,et al.  The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable , 1986, MFCS.

[50]  Oscar H. Ibarra.  The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications , 1978, SIAM J. Comput..

[51]  Rajeev Alur,et al.  Visibly pushdown languages , 2004, STOC '04.

[52]  Oscar H. Ibarra,et al.  On the solvability of a class of diophantine equations and applications , 2006, Theor. Comput. Sci..

[53]  Oscar H. Ibarra,et al.  A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems , 2003, ICALP.

[54]  Jean-Marc Talbot,et al.  Properties of Visibly Pushdown Transducers , 2010, MFCS.

[55]  Alain Finkel,et al.  Reversal-Bounded Counter Machines Revisited , 2008, MFCS.