Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata

摘要

In this paper we consider deterministic pushdown automata on infinite words with restricted use of the stack. More precisely, this study concerns: (1) Behavior of deterministic one-turn pushdown automata using Buechi and Muller modes of acceptance and (2) Closure properties of these sets by Boolean and limit operators.