656 search results - page 7 / 132 » Minimal non-convex words |
WIA
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
WIA
1998
Springer
15 years 1 months ago
1998
Springer
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
CIARP
2004
Springer
15 years 3 months ago
2004
Springer
One of the most important steps in text processing and information retrieval is stemming—reducing of words to stems expressing their base meaning, e.g., bake, baked, bakes, bakin...
DLT
2009
14 years 7 months ago
2009
A word is crucial with respect to a given set of prohibited words (or simply prohibitions) if it avoids the prohibitions but it cannot be extended to the right by any letter of its...
SCOPES
2004
Springer
15 years 3 months ago
2004
Springer
Digital signal processing applications are implemented in embedded systems with fixed-point arithmetic to minimize the cost and the power consumption. To reduce the application ti...