40 search results - page 2 / 8 » On n-power prefix languages |
62
Voted
IJCM
2008
14 years 10 months ago
2008
LREC
2010
14 years 11 months ago
2010
A considerable amount of work has been put into development of stemmers and morphological analysers. The majority of these approaches use hand-crafted suffix-replacement rules but...
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
PLANX
2008
14 years 11 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
COMPUTER
2004
14 years 10 months ago
2004
highly abstracted. The Chinese writing system uses logographs--conventional representations of words or morphemes. Characters of the most common kind have two parts, one suggesting...