Sciweavers

40 search results - page 7 / 8
» On n-power prefix languages
Sort
View
GFKL
2006
Springer
78views Data Mining» more  GFKL 2006»
13 years 9 months ago
Putting Successor Variety Stemming to Work
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, ...
Benno Stein, Martin Potthast
ICFP
2010
ACM
13 years 6 months ago
Functional pearl: every bit counts
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...
Dimitrios Vytiniotis, Andrew Kennedy
DATE
2005
IEEE
97views Hardware» more  DATE 2005»
13 years 11 months ago
Efficient Solution of Language Equations Using Partitioned Representations
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...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
13 years 10 months ago
Bisimulation Lattice of Chi Processes
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-...
Yuxi Fu
NAACL
2003
13 years 7 months ago
TIPS: A Translingual Information Processing System
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, ...
Yaser Al-Onaizan, Radu Florian, Martin Franz, Hany...