Measures of nondeterminism for pushdown automata

✍ Scribed by Kai Salomaa; Sheng Yu

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 652 KB
• Volume: 49
• Category: Article
• ISSN: 0022-0000
• DOI: 10.1016/s0022-0000(05)80054-6

✦ Synopsis

introduced two measures of nondeterminism for pushdown automata and showed interestingly that the second measure, which we refer to as the depth measure, yields an infinite hierarchy of language families between the deterministic context-free and general context-free languages. However, the proof given in op, cit. for this hierarchy theorem was incorrect. In this paper, using a pumping result for deterministic context-free languages we give a new proof for the strictness of the depth hierarchy. We introduce the monadic depth measure which is also shown to give rise to an infinite hierarchy of language families. Furthermore, we show that the monadic hierarchy is shifted by at most one level from the unrestricted depth hierarchy.