8728 search results - page 84 / 1746 » On Reduct Construction Algorithms |
TAPSOFT
1993
Springer
14 years 1 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
BIRTHDAY
2004
Springer
14 years 2 months ago
2004
Springer
We give faster algorithms for two methods of reducing the number of states in nondeterministic finite automata. The first uses equivalences and the second uses preorders. We deve...
AUSAI
2003
Springer
14 years 2 months ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
CAP
2010
13 years 4 months ago
2010
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
COCO
2005
Springer
14 years 2 months ago
2005
Springer