Deletion Operations on Deterministic Families of Automata

Many different deletion operations are investigated applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines as well as finite automata. Operations studied include the prefix, suffix, infix and outfix operations, as well as left and right quotient with languages from different families. It is often expected that language families defined from deterministic machines will not be closed under deletion operations. However, here, it is shown that one-way deterministic reversal-bounded multicounter languages are closed under right quotient with languages from many different language families; even those defined by nondeterministic machines such as the context-free languages, or languages accepted by nondeterministic pushdown machines augmented by any number of reversal-bounded counters. Also, it is shown that when starting with one-way deterministic machines with one counter that makes only one reversal, taking the left quotient with languages from many different language families, again including those defined by nondeterministic machines such as the context-free languages, yields only one-way deterministic reversal-bounded multicounter languages (by increasing the number of counters). However, if there are even just two more reversals on the counter, or a second 1-reversal-bounded counter, taking the left quotient (or even just the suffix operation) yields languages that can neither be accepted by deterministic reversal-bounded multicounter machines, nor by 2-way nondeterministic machines with one reversal-bounded counter. A number of other results with deletion operations are also shown.

[1]  Aravind K. Joshi,et al.  A study of tree adjoining grammars , 1987 .

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

[3]  Lila Kari,et al.  Schema for Parallel Insertion and Deletion , 2010, Developments in Language Theory.

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

[5]  Oscar H. Ibarra,et al.  Visibly Pushdown Automata and Transducers with Counters , 2016, Fundam. Informaticae.

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

[7]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

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

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

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

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

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

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

[14]  Oscar H. Ibarra,et al.  Insertion Operations on Deterministic Reversal-Bounded Counter Machines , 2015, LATA.

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

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

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

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

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

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

[21]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

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

[23]  Grzegorz Rozenberg,et al.  The mathematical theory of L systems , 1980 .

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

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

[26]  Oscar H. Ibarra,et al.  One-reversal counter machines and multihead automata: Revisited , 2011, Theor. Comput. Sci..

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

[28]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1965, Inf. Control..