745 search results - page 39 / 149 » The origins of combinatorics on words |
INFORMATICALT
2000
14 years 9 months ago
2000
An original algorithm for transformation of finite automata to regular expressions is presented. This algorithm is based on effective graph algorithms and gives a transparent new p...
SMA
2003
ACM
15 years 3 months ago
2003
ACM
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
160
click to vote
FOSSACS
2011
Springer
14 years 1 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
CICLING
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Transliterating words and names from one language to another is a frequent and highly productive phenomenon. For example, English word cache is transliterated in Japanese...
CIKM
2001
Springer
15 years 2 months ago
2001
Springer
The success of personal information agents depends on their ability to provide task-relevant information. This paper presents WordSieve, a new algorithm that generates context des...