Semi-deterministic pushdown automata (SDPDA) of order “\(n\)” and \(\beta\)-languages. (English) Zbl 1344.68120
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.
MSC:
68Q45 | Formal languages and automata |