215 search results - page 25 / 43 » On Abstract Finite-State Morphology |
FASE
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
IJAC
2008
13 years 9 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...
CLEF
2009
Springer
13 years 7 months ago
2009
Springer
Abstract. While classical approaches to unsupervised morphology acquisition often rely on metrics based on information theory for identifying morphemes, we describe a novel approac...
ECCV
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Mathematical Morphology (MM) offers a wide range of operators to address various image processing problems. These processing can be defined in terms of algebraic set or a...