On measuring nondeterminism in regular languages
Information and Computation
Measures of nondeterminism for pushdown automata
Journal of Computer and System Sciences
ACM SIGACT News
On the Amount of Nondeterminism and the Power of Verifying
SIAM Journal on Computing
Pushdown automata with bounded nondeterminism and bounded ambiguity
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Regular Closure of Deterministic Languages
SIAM Journal on Computing
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Refining nondeterminism below linear time
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
Computations with a restricted number of nondeterministic steps.
Computations with a restricted number of nondeterministic steps.
Measuring nondeterminism in pushdown automata
Journal of Computer and System Sciences
Regulated nondeterminism in pushdown automata
Theoretical Computer Science
Regulated nondeterminism in pushdown automata
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
| Hi-index | 5.23 |
Pushdown 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.