42 search results - page 1 / 9 » Empty Alternation |
MFCS
1994
Springer
13 years 9 months ago
1994
Springer
We introduce the notion of empty alternation by investigating alternating automata which are restricted to empty their storage except for a logarithmically space-bounded tape befor...
IPL
2007
13 years 5 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
STOC
1998
ACM
13 years 10 months ago
1998
ACM
LICS
2010
IEEE
13 years 4 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
DLT
2008
13 years 7 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...