Summary: In this paper, we introduce the notion of semi-deterministic pushdown automata of order \(n\). We also introduce \(\beta\)-languages as a subclass of the class of context-free languages and study the relation between them.