Deterministic input-driven queue automata: Finite turns, decidability, and closure properties

We introduce and study the model of deterministic input-driven queue automata. On such devices, the input letters uniquely determine the operations on the memory store which is organized as a queue. In particular, we consider the case where only a finite number of turns on the queue is allowed. The resulting language families share with regular languages many desirable properties. We show that emptiness and several other problems are decidable. Furthermore, we investigate closure under Boolean operations. The existence of an infinite and tight hierarchy depending on the number of turns is also proved.

[1]  Burchard von Braunmühl,et al.  Input-Driven Languages are Recognized in log n Space , 1983, FCT.

[2]  Kai Salomaa,et al.  Operational state complexity of nested word automata , 2008, Theor. Comput. Sci..

[3]  Stefano Crespi-Reghizzi,et al.  Operator precedence and the visibly pushdown property , 2012, J. Comput. Syst. Sci..

[4]  Katja Meckel,et al.  Queue Automata of Constant Length , 2013, DCFS.

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

[6]  Gennaro Parlato,et al.  The tree width of auxiliary storage , 2011, POPL '11.

[7]  Alexander Okhotin,et al.  State Complexity of Operations on Input-Driven Pushdown Automata , 2011, MFCS.

[8]  Seymour Ginsburg,et al.  One-way stack automata , 1967, JACM.

[9]  Jean Berstel,et al.  Context-Free Languages and Pushdown Automata , 1997, Handbook of Formal Languages.

[10]  Franz-Josef Brandenburg,et al.  On the Intersection of Stacks and Queues , 1988, Theor. Comput. Sci..

[11]  Franz-Josef Brandenburg,et al.  Intersections of Some Families of Languages , 1986, ICALP.

[12]  Leslie G. Valiant.  The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata , 1974, Inf. Control..

[13]  Andreas Malcher,et al.  A Direct Construction of Finite State Automata for Pushdown Store Languages , 2013, DCFS.

[14]  Martin Kutrib,et al.  Descriptional Complexity - An Introductory Survey , 2010, Scientific Applications of Language Methods.

[15]  Igor Walukiewicz,et al.  Minimizing Variants of Visibly Pushdown Automata , 2007, MFCS.

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

[17]  Yo-Sub Han,et al.  Nondeterministic state complexity of nested word automata , 2009, Theor. Comput. Sci..

[18]  K. Mehlhorn.  Pebbling Moutain Ranges and its Application of DCFL-Recognition , 1980, ICALP.

[19]  Franz-Josef Brandenburg,et al.  Multiple Equality Sets and Post Machines , 1980, J. Comput. Syst. Sci..

[20]  Eugene Galanter,et al.  Handbook of mathematical psychology: I. , 1963 .

[21]  Géraud Sénizergues,et al.  Complete formal systems for equivalence problems , 2000, Theor. Comput. Sci..

[22]  Martin Kutrib,et al.  Flip-Pushdown Automata: Nondeterminism Is Better than Determinism , 2003, Developments in Language Theory.

[23]  Carlo Mereghetti,et al.  More concise representation of regular languages by automata and regular expressions , 2010, Inf. Comput..

[24]  Luca Breveglieri,et al.  Real-Time Scheduling by Queue Automata , 1992, FTRTFT.

[25]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[26]  Andreas Malcher,et al.  Descriptional complexity of two-way pushdown automata with restricted head reversals , 2011, Theor. Comput. Sci..

[27]  Martin Kutrib,et al.  Input-Driven Stack Automata , 2012, IFIP TCS.

[28]  Roland Vollmar,et al.  Über einen Automaten mit Pufferspeicherung , 1970, Computing.

[29]  Sheila A. Greibach,et al.  An Infinite Hierarchy of Context-Free Languages , 1969, JACM.

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

[31]  Alessandra Cherubini,et al.  QRT FIFO Automata, Breath-First Grammars and Their Relations , 1991, Theor. Comput. Sci..

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

[33]  Patrick W. Dymond.  Input-Driven Languages are in log n Depth , 1988, Inf. Process. Lett..

[34]  Salvatore La Torre,et al.  A Robust Class of Context-Sensitive Languages , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[35]  Martin Kutrib,et al.  Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k , 2003, ICALP.