40 search results - page 7 / 8 » On n-power prefix languages |
GFKL
2006
Springer
15 years 1 months ago
2006
Springer
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
ICFP
2010
ACM
14 years 11 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
ASIAN
1998
Springer
15 years 2 months ago
1998
Springer
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
105
click to vote
NAACL
2003
14 years 11 months ago
2003
Searching online information is increasingly a daily activity for many people. The multilinguality of online content is also increasing (e.g. the proportion of English web users, ...