Insertion Operations on Deterministic Reversal-Bounded Counter Machines

Abstract Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines. These operations are defined by the ideals obtained from relations such as the prefix, infix, suffix, and outfix relations, as well as operations defined from inverses of a type of deterministic transducer with reversal-bounded counters attached. The question of whether the resulting languages can always be accepted by deterministic machines with the same number (or larger number) of input-turns (resp., counters, counter-reversals, etc.) is investigated.

[1]  Giusi Castiglione,et al.  On a class of languages with holonomic generating functions , 2017, Theor. Comput. Sci..

[2]  Mark Daley,et al.  Theoretical and computational properties of transpositions , 2010, Natural Computing.

[3]  Oscar H. Ibarra,et al.  One-Reversal Counter Machines and Multihead Automata: Revisited , 2011, SOFSEM.

[4]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[5]  Oscar H. Ibarra.  On Strong Reversibility in P Systems and Related Problems , 2011, Int. J. Found. Comput. Sci..

[6]  Lila Kari,et al.  Schema for Parallel Insertion and Deletion: Revisited , 2011, Int. J. Found. Comput. Sci..

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

[8]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[9]  Oscar H. Ibarra,et al.  Counter Machines and Verification Problems , 2002, Theor. Comput. Sci..

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

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

[12]  Oscar H. Ibarra.  On decidability and closure properties of language classes with respect to bio-operations , 2015, Natural Computing.

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

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

[15]  Cyril Nicaud,et al.  Average State Complexity of Operations on Unary Automata , 1999, MFCS.

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

[17]  Lila Kari,et al.  Morphisms preserving densities , 2001, Int. J. Comput. Math..

[18]  L F Landweber,et al.  The evolution of cellular computing: nature's solution to a computational problem. , 1999, Bio Systems.

[19]  Marek Chrobak,et al.  Finite Automata and Unary Languages , 1986, Theor. Comput. Sci..

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

[21]  Oscar H. Ibarra,et al.  The effect of end-markers on counter machines and commutativity , 2016, Theor. Comput. Sci..

[22]  Derick Wood,et al.  The generalization of generalized automata: expression automata , 2005, Int. J. Found. Comput. Sci..

[23]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1966, Inf. Control..

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

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