4 search results - page 1 / 1 » Regulated Nondeterminism in Pushdown Automata |
WIA
2007
Springer
14 years 3 months ago
2007
Springer
COCO
2010
Springer
14 years 1 months ago
2010
Springer
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...
JUCS
2002
13 years 9 months ago
2002
: Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of diff...
JALC
2007
13 years 9 months ago
2007
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...