303 search results - page 26 / 61 » Automata on Gauss Words |
91
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
121
Voted
EUROPAR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We investigate the performance of two approaches for matrix inversion based on Gaussian (LU factorization) and Gauss-Jordan eliminations. The target architecture is a cur...
112
click to vote
ICDT
2012
ACM
13 years 2 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
105
click to vote
STRINGOLOGY
2008
15 years 1 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
116
click to vote
FCT
1991
Springer
15 years 4 months ago
1991
Springer
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...