5 research outputs found
Measures of nondeterminism for pushdown automata
Two measures of nondeterminism are introduced and used for classification of context-free languages (CFLs). Three families of CFLs covering the whole set of CFLs are considered
Context-dependent nondeterminism for pushdown automata
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. Moreover, nondeterministic steps are allowed only within certain contexts, i.e., in configurations that meet particular conditions. The relationships of the accepted language families with closures of the deterministic context-free languages (DCFL) under regular operations are studied. For example, automata with unbounded nondeterminism that have to empty their pushdown store up to the initial symbol in order to make a guess are characterized by the regular closure of DCFL. Automata that additionally have to reenter the initial state are (almost) characterized by the Kleene star closure of the union closure of the prefix-free deterministic context-free languages. Pushdown automata with bounded nondeterminism are characterized by the union closure of DCFL in any of the considered contexts. Proper inclusions between all language classes discussed are shown. Finally, closure properties of these families under AFL operations are investigated
Measures of nondeterminism for pushdown automata
D. Vermeir and W. Savitch (Fund. Inform. 4 (1981), 401–418) 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
Measures of nondeterminism for pushdown automata
Two measures of nondeterminism are introduced and used for classification of context-free languages (CFLs). Three families of CFLs covering the whole set of CFLs are considered