Search results for "TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES"
showing 10 items of 68 documents
Real-Time Vector Automata
2013
We study the computational power of real-time finite automata that have been augmented with a vector of dimension k, and programmed to multiply this vector at each step by an appropriately selected k×k matrix. Only one entry of the vector can be tested for equality to 1 at any time. Classes of languages recognized by deterministic, nondeterministic, and "blind" versions of these machines are studied and compared with each other, and the associated classes for multicounter automata, automata with multiplication, and generalized finite automata.
Correcting for Potential Barriers in Quantum Walk Search
2015
A randomly walking quantum particle searches in Grover's $\Theta(\sqrt{N})$ iterations for a marked vertex on the complete graph of $N$ vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a "coin" flip, and hopping. Physically, however, potential energy barriers can hinder the hop and cause the search to fail, even when the amplitude of not hopping decreases with $N$. We correct for these errors by interpreting the quantum walk search as an amplitude amplification algorithm and modifying the phases applied by the coin flip and oracle such that the amplification recovers the $\Theta(\sqrt{N})$ runtime.
First spatial isotopic separation of relativistic uranium projectile fragments
1994
Abstract Spatial isotopic separation of relativistic uranium projectile fragments has been achieved for the first time. The fragments were produced in peripheral nuclear collisions and spatially separated in-flight with the fragment separator FRS at GSI. A two-fold magnetic-rigidity analysis was applied exploiting the atomic energy loss in specially shaped matter placed in the dispersive central focal plane. Systematic investigations with relativistic projectiles ranging from oxygen up to uranium demonstrate that the FRS is a universal and powerful facility for the production and in-flight separation of monoisotopic, exotic secondary beams of all elements up to Z = 92. This achievement has …
Non-Markovian dynamics and steady-state entanglement of cavity arrays in finite-bandwidth squeezed reservoirs
2014
When two chains of quantum systems are driven at their ends by a two-mode squeezed reservoir, they approach a steady state characterized by the formation of many entangled pairs. Each pair is made of one element of the first and one of the second chain. This effect has been already predicted under the assumption of broadband squeezing. Here we investigate the situation of finite-bandwidth reservoirs. This is done by modeling the driving bath as the output field of a non-degenerate parametric oscillator. The resulting non-Markovian dynamics is studied within the theoretical framework of cascade open quantum systems. It is shown that the formation of pair-entangled structures occurs as long a…
The class of languages recognizable by 1-way quantum finite automata is not closed under union
2000
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular languages. In this paper we show, that class of languages recognizable by QFA is not closed under union, even not under any Boolean operation, where both arguments are significant.
The set of conjugacy class sizes of a finite group does not determine its solvability
2014
Abstract We find a pair of groups, one solvable and the other non-solvable, with the same set of conjugacy class sizes.
Design-based estimation for geometric quantiles with application to outlier detection
2010
Geometric quantiles are investigated using data collected from a complex survey. Geometric quantiles are an extension of univariate quantiles in a multivariate set-up that uses the geometry of multivariate data clouds. A very important application of geometric quantiles is the detection of outliers in multivariate data by means of quantile contours. A design-based estimator of geometric quantiles is constructed and used to compute quantile contours in order to detect outliers in both multivariate data and survey sampling set-ups. An algorithm for computing geometric quantile estimates is also developed. Under broad assumptions, the asymptotic variance of the quantile estimator is derived an…
Descriptional and Computational Complexity of the Circuit Representation of Finite Automata
2018
In this paper we continue to investigate the complexity of the circuit representation of DFA—BC-complexity. We compare it with nondeterministic state complexity, obtain upper and lower bounds which differ only by a factor of 4 for a Binary input alphabet. Also we prove that many simple operations (determining if a state is reachable or if an automaton is minimal) are PSPACE-complete for DFA given in circuit representation.
An Approximate Determinization Algorithm for Weighted Finite-State Automata
2001
Nondeterministic weighted finite-state automata are a key abstraction in automatic speech recognition systems. The efficiency of automatic speech recognition depends directly on the sizes of these automata and the degree of nondeterminism present, so recent research has studied ways to determinize and minimize them, using analogues of classical automata determinization and minimization. Although, as we describe here, determinization can in the worst case cause poly-exponential blowup in the number of states of a weighted finite-state automaton, in practice it is remarkably successful. In extensive experiments in automatic speech recognition systems, deterministic weighted finite-state autom…
Supplementary tables from Antibiotics accelerate growth at the expense of immunity
2021
This file contains the enrichment, annotation, a list of pathogenic bacteria, the primer sequences, and life-history data