<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/user/a_olympia/Word"><title>BibSonomy bookmarks for /user/a_olympia/Word</title><link>http://www.bibsonomy.org/rss/user/a_olympia/Word</link><description>BibSonomy RSS Feed for /user/a_olympia/Word</description><items><rdf:Seq><rdf:li rdf:resource="http://www.cosc.canterbury.ac.nz/greg.ewing/python/Pyrex/"/><rdf:li rdf:resource="http://webworkerdaily.com/2007/06/22/10-free-minimalist-word-processors/"/><rdf:li rdf:resource="http://www.donationcoder.com/Reviews/Archive/WordProcs/index_fullh.html"/><rdf:li rdf:resource="http://www.sciencedirect.com/science?_ob=ArticleURL&amp;_udi=B6V00-4F1H019-1&amp;_user=10&amp;_coverDate=01%2F28%2F2005&amp;_rdoc=1&amp;_fmt=&amp;_orig=search&amp;_sort=d&amp;view=c&amp;_acct=C000050221&amp;_version=1&amp;_urlVersion=0&amp;_userid=10&amp;md5=b5cc14fcac984f46a028e08219702674"/><rdf:li rdf:resource="http://mathworld.wolfram.com/LyndonWord.html"/></rdf:Seq></items></channel><item rdf:about="http://www.cosc.canterbury.ac.nz/greg.ewing/python/Pyrex/"><title>Pyrex</title><description></description><link>http://www.cosc.canterbury.ac.nz/greg.ewing/python/Pyrex/</link><dc:creator>a_olympia</dc:creator><dc:date>2008-04-15T19:58:36+02:00</dc:date><dc:subject>Software technology c opensource optimization code science python extension scripts API tools programming Toolkit Word TOOL c++ language open_source pyrex </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Software"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/technology"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/c"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/opensource"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/optimization"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/science"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/python"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/extension"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/scripts"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/API"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Toolkit"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Word"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/TOOL"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/c++"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/language"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/open_source"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pyrex"/></rdf:Bag></taxo:topics></item><item rdf:about="http://webworkerdaily.com/2007/06/22/10-free-minimalist-word-processors/"><title>Web Worker Daily » Blog Archive 10 Free Minimalist Word Processors for Greater Productivity «</title><description></description><link>http://webworkerdaily.com/2007/06/22/10-free-minimalist-word-processors/</link><dc:creator>a_olympia</dc:creator><dc:date>2007-06-22T17:01:08+02:00</dc:date><dc:subject>tools software writing word productivity </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/writing"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/word"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/productivity"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.donationcoder.com/Reviews/Archive/WordProcs/index_fullh.html"><title>Word Processor Review — DonationCoder.com</title><description></description><link>http://www.donationcoder.com/Reviews/Archive/WordProcs/index_fullh.html</link><dc:creator>a_olympia</dc:creator><dc:date>2007-06-22T16:59:43+02:00</dc:date><dc:subject>computer office reviews articles docs writing downloads comparison computers software tools article apps word review </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computer"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/office"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/reviews"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/articles"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/docs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/writing"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/downloads"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/comparison"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computers"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/apps"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/word"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/review"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.sciencedirect.com/science?_ob=ArticleURL&amp;_udi=B6V00-4F1H019-1&amp;_user=10&amp;_coverDate=01%2F28%2F2005&amp;_rdoc=1&amp;_fmt=&amp;_orig=search&amp;_sort=d&amp;view=c&amp;_acct=C000050221&amp;_version=1&amp;_urlVersion=0&amp;_userid=10&amp;md5=b5cc14fcac984f46a028e08219702674"><title>ScienceDirect - Discrete Mathematics : The standard factorization of Lyndon words: an average point of view</title><description>Abstract  A non-empty word w is a Lyndon word if and only if it is strictly smaller for the lexicographical order than any of its proper suffixes. Such a word w is either a letter or admits a standard factorization uv where v is its smallest proper suffix</description><link>http://www.sciencedirect.com/science?_ob=ArticleURL&amp;amp;_udi=B6V00-4F1H019-1&amp;amp;_user=10&amp;amp;_coverDate=01%2F28%2F2005&amp;amp;_rdoc=1&amp;amp;_fmt=&amp;amp;_orig=search&amp;amp;_sort=d&amp;amp;view=c&amp;amp;_acct=C000050221&amp;amp;_version=1&amp;amp;_urlVersion=0&amp;amp;_userid=10&amp;amp;md5=b5cc14fcac984f46a028e08219702674</link><dc:creator>a_olympia</dc:creator><dc:date>2007-05-13T08:43:44+02:00</dc:date><dc:subject>Lyndon word </dc:subject><content:encoded>Abstract  A non-empty word w is a Lyndon word if and only if it is strictly smaller for the lexicographical order than any of its proper suffixes. Such a w&lt;span class=&#034;info&#034;&gt;...&lt;span&gt;Abstract  A non-empty word w is a Lyndon word if and only if it is strictly smaller for the lexicographical order than any of its proper suffixes. Such a word w is either a letter or admits a standard factorization uv where v is its smallest proper suffix&lt;/span&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Lyndon"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/word"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mathworld.wolfram.com/LyndonWord.html"><title>Lyndon Word -- from Wolfram MathWorld</title><description></description><link>http://mathworld.wolfram.com/LyndonWord.html</link><dc:creator>a_olympia</dc:creator><dc:date>2007-02-23T16:49:55+01:00</dc:date><dc:subject>MathWorld Word Lyndon Wolfram </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/MathWorld"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Word"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Lyndon"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Wolfram"/></rdf:Bag></taxo:topics></item></rdf:RDF>