2465 search results - page 17 / 493 » Automata on Linear Orderings |
105
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...
100
Voted
LICS
2010
IEEE
15 years 8 days ago
2010
IEEE
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
120
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
- Structural properties of two well-known families of keystream generators, Shrinking Generators and Cellular Automata, have been analyzed. Emphasis is on the equivalenceof the bin...
136
Voted
JUCS
2010
15 years 8 days ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
138
click to vote
RTA
2005
Springer
15 years 7 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...