29 search results - page 2 / 6 » An Improved Lower Bound for the Complementation of Rabin Aut... |
ICALP
1999
Springer
13 years 9 months ago
1999
Springer
We introduce new techniques for studying the structure of partial k-trees. In particular, we show that the complements of partial k-trees provide an intuitively-appealing character...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
DLT
2007
13 years 6 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
APPROX
2007
Springer
13 years 9 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...