Sciweavers

433 search results - page 40 / 87
» On stabilizers of infinite words
Sort
View
96
Voted
ECCC
2000
75views more  ECCC 2000»
14 years 11 months ago
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
Andreas Klein, Martin Kutrib
JSC
2000
60views more  JSC 2000»
14 years 11 months ago
Generic Extensions and Generic Polynomials
This paper presents a generalization of a theorem of Saltman on the existence of generic extensions with group A G over an infinite field K, where A is abelian, using less restri...
Arne Ledet
FUIN
2010
158views more  FUIN 2010»
14 years 8 months ago
Cellular Automata, Decidability and Phasespace
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
Klaus Sutner
SIGIR
2000
ACM
15 years 3 months ago
Evaluating evaluation measure stability
: This paper presents a novel way of examining the accuracy of the evaluation measures commonly used in information retrieval experiments. It validates several of the rules-of-thum...
Chris Buckley, Ellen M. Voorhees
APPML
2010
112views more  APPML 2010»
14 years 11 months ago
Computing Fourier transforms and convolutions of Sn-1-invariant signals on Sn in time linear in n
Let Sn denote the symmetric group on {1, . . . , n} and Sn-1 the stabilizer subgroup of n. We derive algorithms for computing Fourier transforms of left and right Sn-1-invariant s...
Michael Clausen, Ramakrishna Kakarala