Input-Driven queue automata: finite turns, decidability, and closure properties

Authors:
Martin Kutrib;Andreas Malcher;Carlo Mereghetti;Beatrice Palano;Matthias Wendlandt
Affiliations:
Institut für Informatik, Universität Giessen, Giessen, Germany;Institut für Informatik, Universität Giessen, Giessen, Germany;Dip. Informatica, Univ. degli Studi di Milano, Milano, Italy;Dip. Informatica, Univ. degli Studi di Milano, Milano, Italy;Institut für Informatik, Universität Giessen, Giessen, Germany
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 15
Cited 0

Input-driven languages are in log n depth

Information Processing Letters
QRT FIFO automata, breadth-first grammars and their relations

Theoretical Computer Science
One-way stack automata

Journal of the ACM (JACM)
An Infinite Hierarchy of Context-Free Languages

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Pebbling Moutain Ranges and its Application of DCFL-Recognition

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Input-Driven Languages are Recognized in log n Space

Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Visibly pushdown languages

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Robust Class of Context-Sensitive Languages

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Adding nesting structure to words

Journal of the ACM (JACM)
Flip-pushdown automata: nondeterminism is better than determinism

DLT'03 Proceedings of the 7th international conference on Developments in language theory
Flip-pushdown automata: k + 1 pushdown reversals are better than k

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
The tree width of auxiliary storage

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Descriptional complexity of two-way pushdown automata with restricted head reversals

Theoretical Computer Science
Input-Driven stack automata

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce and study the model of 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.