2,633 research outputs found
Revisiting the Equivalence Problem for Finite Multitape Automata
The decidability of determining equivalence of deterministic multitape
automata (or transducers) was a longstanding open problem until it was resolved
by Harju and Karhum\"{a}ki in the early 1990s. Their proof of decidability
yields a co_NP upper bound, but apparently not much more is known about the
complexity of the problem. In this paper we give an alternative proof of
decidability, which follows the basic strategy of Harju and Karhumaki but
replaces their use of group theory with results on matrix algebras. From our
proof we obtain a simple randomised algorithm for deciding language equivalence
of deterministic multitape automata and, more generally, multiplicity
equivalence of nondeterministic multitape automata. The algorithm involves only
matrix exponentiation and runs in polynomial time for each fixed number of
tapes. If the two input automata are inequivalent then the algorithm outputs a
word on which they differ
Remarks on NonHamiltonian Statistical Mechanics: Lyapunov Exponents and Phase-Space Dimensionality Loss
The dissipation associated with nonequilibrium flow processes is reflected by
the formation of strange attractor distributions in phase space. The
information dimension of these attractors is less than that of the equilibrium
phase space, corresponding to the extreme rarity of nonequilibrium states. Here
we take advantage of a simple model for heat conduction to demonstrate that the
nonequilibrium dimensionality loss can definitely exceed the number of
phase-space dimensions required to thermostat an otherwise Hamiltonian system.Comment: 5 pages, 2 figures, minor typos correcte
Theory of impedance networks: The two-point impedance and LC resonances
We present a formulation of the determination of the impedance between any
two nodes in an impedance network. An impedance network is described by its
Laplacian matrix L which has generally complex matrix elements. We show that by
solving the equation L u_a = lambda_a u_a^* with orthonormal vectors u_a, the
effective impedance between nodes p and q of the network is Z = Sum_a [u_{a,p}
- u_{a,q}]^2/lambda_a where the summation is over all lambda_a not identically
equal to zero and u_{a,p} is the p-th component of u_a. For networks consisting
of inductances (L) and capacitances (C), the formulation leads to the
occurrence of resonances at frequencies associated with the vanishing of
lambda_a. This curious result suggests the possibility of practical
applications to resonant circuits. Our formulation is illustrated by explicit
examples.Comment: 21 pages, 3 figures; v4: typesetting corrected; v5: Eq. (63)
correcte
Spanning Trees on Graphs and Lattices in d Dimensions
The problem of enumerating spanning trees on graphs and lattices is
considered. We obtain bounds on the number of spanning trees and
establish inequalities relating the numbers of spanning trees of different
graphs or lattices. A general formulation is presented for the enumeration of
spanning trees on lattices in dimensions, and is applied to the
hypercubic, body-centered cubic, face-centered cubic, and specific planar
lattices including the kagom\'e, diced, 4-8-8 (bathroom-tile), Union Jack, and
3-12-12 lattices. This leads to closed-form expressions for for these
lattices of finite sizes. We prove a theorem concerning the classes of graphs
and lattices with the property that
as the number of vertices , where is a finite
nonzero constant. This includes the bulk limit of lattices in any spatial
dimension, and also sections of lattices whose lengths in some dimensions go to
infinity while others are finite. We evaluate exactly for the
lattices we considered, and discuss the dependence of on d and the
lattice coordination number. We also establish a relation connecting to the free energy of the critical Ising model for planar lattices .Comment: 28 pages, latex, 1 postscript figure, J. Phys. A, in pres
Uniform tiling with electrical resistors
The electric resistance between two arbitrary nodes on any infinite lattice
structure of resistors that is a periodic tiling of space is obtained. Our
general approach is based on the lattice Green's function of the Laplacian
matrix associated with the network. We present several non-trivial examples to
show how efficient our method is. Deriving explicit resistance formulas it is
shown that the Kagom\'e, the diced and the decorated lattice can be mapped to
the triangular and square lattice of resistors. Our work can be extended to the
random walk problem or to electron dynamics in condensed matter physics.Comment: 22 pages, 14 figure
Diffusion Processes on Small-World Networks with Distance-Dependent Random-Links
We considered diffusion-driven processes on small-world networks with
distance-dependent random links. The study of diffusion on such networks is
motivated by transport on randomly folded polymer chains, synchronization
problems in task-completion networks, and gradient driven transport on
networks. Changing the parameters of the distance-dependence, we found a rich
phase diagram, with different transient and recurrent phases in the context of
random walks on networks. We performed the calculations in two limiting cases:
in the annealed case, where the rearrangement of the random links is fast, and
in the quenched case, where the link rearrangement is slow compared to the
motion of the random walker or the surface. It has been well-established that
in a large class of interacting systems, adding an arbitrarily small density
of, possibly long-range, quenched random links to a regular lattice interaction
topology, will give rise to mean-field (or annealed) like behavior. In some
cases, however, mean-field scaling breaks down, such as in diffusion or in the
Edwards-Wilkinson process in "low-dimensional" small-world networks. This
break-down can be understood by treating the random links perturbatively, where
the mean-field (or annealed) prediction appears as the lowest-order term of a
naive perturbation expansion. The asymptotic analytic results are also
confirmed numerically by employing exact numerical diagonalization of the
network Laplacian. Further, we construct a finite-size scaling framework for
the relevant observables, capturing the cross-over behaviors in finite
networks. This work provides a detailed account of the
self-consistent-perturbative and renormalization approaches briefly introduced
in two earlier short reports.Comment: 36 pages, 27 figures. Minor revisions in response to the referee's
comments. Furthermore, some typos were fixed and new references were adde
Influence of realistic parameters on state-of-the-art LWFA experiments
We examine the influence of non-ideal plasma-density and non-Gaussian
transverse laser-intensity profiles in the laser wakefield accelerator
analytically and numerically. We find that the characteristic amplitude and
scale length of longitudinal density fluctuations impacts on the final energies
achieved by electron bunches. Conditions that minimize the role of the
longitudinal plasma density fluctuations are found. The influence of higher
order Laguerre-Gaussian laser pulses is also investigated. We find that higher
order laser modes typically lead to lower energy gains. Certain combinations of
higher order modes may, however, lead to higher electron energy gains.Comment: 16 pages, 6 figures; Accepted for publication in Plasma Physics and
Controlled Fusio
Angular Dependences of Third Harmonic Generation from Microdroplets
We present experimental and theoretical results for the angular dependence of
third harmonic generation (THG) of water droplets in the micrometer range (size
parameter ). The THG signal in - and -polarization obtained
with ultrashort laser pulses is compared with a recently developed nonlinear
extension of classical Mie theory including multipoles of order .
Both theory and experiment yield over a wide range of size parameters
remarkably stable intensity maxima close to the forward and backward direction
at ``magic angles''. In contrast to linear Mie scattering, both are of
comparable intensity.Comment: 4 pages, RevTeX, 3 figures available on request from
[email protected], submitted to PR
Probabilistic Bisimulation: Naturally on Distributions
In contrast to the usual understanding of probabilistic systems as stochastic
processes, recently these systems have also been regarded as transformers of
probabilities. In this paper, we give a natural definition of strong
bisimulation for probabilistic systems corresponding to this view that treats
probability distributions as first-class citizens. Our definition applies in
the same way to discrete systems as well as to systems with uncountable state
and action spaces. Several examples demonstrate that our definition refines the
understanding of behavioural equivalences of probabilistic systems. In
particular, it solves a long-standing open problem concerning the
representation of memoryless continuous time by memory-full continuous time.
Finally, we give algorithms for computing this bisimulation not only for finite
but also for classes of uncountably infinite systems
- …