Conference paper

Publication year: 2018

Pages: 89-110

Journal: RAIRO: Theoretical Informatics and Applications

Volume number: 52

Issue number: 2-4

ISSN: 0988-3754

eISSN: 1290-385X

DOI Link: https://doi.org/10.1051/ita/2018009

Conference: 8th Workshop on Non-Classical Models of Automata and Applications (NCMA)

Publisher: EDP Sciences

Abstract: 
We introduce and study the model of diving queue automata which are basically finite automata equipped with a storage medium that is organized as a queue. Additionally, two queue heads are provided at both ends of the queue that can move in a read-only mode inside the queue. In particular, we consider suitable time constraints and the case where only a finite number of turns on the queue is allowed. As one main result we obtain a proper queue head hierarchy, that is, two heads are better than one head, and one head is better than no head. Moreover, it is shown that the model with one queue head, finitely many turns, and no time constraints as well as the model with two queue heads, possibly infinitely many turns, and time constraints is captured by P and has a P-complete membership problem. We obtain also that a subclass of the model with two queue heads is already captured by logarithmic space. Finally, we consider decidability questions and it turns out that almost nothing is decidable for the model with two queue heads, whereas we obtain that at least emptiness and finiteness are decidable for subclasses of the model with one queue head.

Harvard Citation style: Beier, S., Kutrib, M., Malcher, A. and Wendlandt, M. (2018) DIVING INTO THE QUEUE, RAIRO: Theoretical Informatics and Applications, 52(2-4), pp. 89-110. https://doi.org/10.1051/ita/2018009

APA Citation style: Beier, S., Kutrib, M., Malcher, A., & Wendlandt, M. (2018). DIVING INTO THE QUEUE. RAIRO: Theoretical Informatics and Applications. 52(2-4), 89-110. https://doi.org/10.1051/ita/2018009