2465 search results - page 144 / 493 » Automata on Linear Orderings |
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
An -tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism probl...
NOLISP
2007
Springer
14 years 3 months ago
2007
Springer
This paper compares the identification rates of a speaker recognition system using several parameterizations, with special emphasis on the residual signal obtained from linear and...
HYBRID
2003
Springer
14 years 2 months ago
2003
Springer
We analyze the observability of the continuous and discrete states of continuous-time linear hybrid systems. For the class of jumplinear systems, we derive necessary and sufficient...
FSE
1999
Springer
14 years 1 months ago
1999
Springer
In this paper we evaluate the resistance of the block cipher RC5 against linear cryptanalysis. We describe a known plaintext attack that can break RC5-32 (blocksize 64) with 10 rou...