Add to ORKGTwo 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
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
AbstractThe notion of an alternating context-free grammar is introduced and it is shown that the cla...
AbstractThe growing context-sensitive languages are characterized by a non-deterministic machine mod...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
D. Vermeir and W. Savitch (Fund. Inform. 4 (1981), 401–418) introduced two measures of nondeterminis...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractRestarting automata can be seen as analytical variants of classical automata as well as of r...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
AbstractFor every pair of positive integers n and p, there is a language accepted by a real-time det...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
AbstractThe notion of an alternating context-free grammar is introduced and it is shown that the cla...
AbstractThe growing context-sensitive languages are characterized by a non-deterministic machine mod...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
Two measures of nondeterminism are introduced and used for classification of context-free languages ...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
D. Vermeir and W. Savitch (Fund. Inform. 4 (1981), 401–418) introduced two measures of nondeterminis...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractPushdown automata using a limited and unlimited amount of nondeterminism are investigated. M...
ω-type context-free languages are ω-type languages generated by ω-type context-free grammers, and al...
AbstractRestarting automata can be seen as analytical variants of classical automata as well as of r...
AbstractA generalization of pushdown automata towards regulated nondeterminism is studied. The nonde...
AbstractFor every pair of positive integers n and p, there is a language accepted by a real-time det...
AbstractThe amount of nondeterminism that a pushdown automaton requires to recognize an input string...
AbstractThe notion of an alternating context-free grammar is introduced and it is shown that the cla...
AbstractThe growing context-sensitive languages are characterized by a non-deterministic machine mod...