293 search results - page 12 / 59 » Optimal Integer Alphabetic Trees in Linear Time |
LATA
2010
Springer
14 years 14 days ago
2010
Springer
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...
JACM
2007
13 years 7 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
SAT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
WIA
2009
Springer
14 years 4 days ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
FMCAD
2006
Springer
13 years 11 months ago
2006
Springer
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B