1,207 research outputs found
MSO definable string transductions and two-way finite state transducers
String transductions that are definable in monadic second-order (mso) logic
(without the use of parameters) are exactly those realized by deterministic
two-way finite state transducers. Nondeterministic mso definable string
transductions (i.e., those definable with the use of parameters) correspond to
compositions of two nondeterministic two-way finite state transducers that have
the finite visit property. Both families of mso definable string transductions
are characterized in terms of Hennie machines, i.e., two-way finite state
transducers with the finite visit property that are allowed to rewrite their
input tape.Comment: 63 pages, LaTeX2e. Extended abstract presented at 26-th ICALP, 199
Quaternary matroids are vf-safe
Binary delta-matroids are closed under vertex flips, which consist of the
natural operations of twist and loop complementation. In this note we provide
an extension of this result from GF(2) to GF(4). As a consequence, quaternary
matroids are "safe" under vertex flips (vf-safe for short). As an application,
we find that the matroid of a bicycle space of a quaternary matroid is
independent of the chosen representation. This extends a result of Vertigan [J.
Comb. Theory B (1998)] concerning the bicycle dimension of quaternary matroids.Comment: 8 pages, no figures, the contents of this paper is now merged into v2
of [arXiv:1210.7718] (except for this comment, v2 is identical to v1
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
String languages recognizable in (deterministic) log-space are characterized
either by two-way (deterministic) multi-head automata, or following Immerman,
by first-order logic with (deterministic) transitive closure. Here we elaborate
this result, and match the number of heads to the arity of the transitive
closure. More precisely, first-order logic with k-ary deterministic transitive
closure has the same power as deterministic automata walking on their input
with k heads, additionally using a finite set of nested pebbles. This result is
valid for strings, ordered trees, and in general for families of graphs having
a fixed automaton that can be used to traverse the nodes of each of the graphs
in the family. Other examples of such families are grids, toruses, and
rectangular mazes. For nondeterministic automata, the logic is restricted to
positive occurrences of transitive closure.
The special case of k=1 for trees, shows that single-head deterministic
tree-walking automata with nested pebbles are characterized by first-order
logic with unary deterministic transitive closure. This refines our earlier
result that placed these automata between first-order and monadic second-order
logic on trees.Comment: Paper for Logical Methods in Computer Science, 27 pages, 1 figur
Spin transport and spin dynamics in antiferromagnets
Ferromagnets (FMs) have been a key ingredient in information technology because it is easy to manipulate and read out the magnetization. Antiferromagnets (AFMs) have magnetic moments with alternating direction resulting in negligible magnetization. This gives them high processing and device downscaling features, but this also makes it challenging to manipulate and interact with the AFM order. This thesis studies this interaction with antiferromagnets. NiO AFM order has been read out by electrically injecting spin current via the spin Hall effect in thin heavy metal films. In DyFeO3, both Dy and Fe magnetic moments, their excitation and interaction have been probed. A magnetic field lifts the degeneracy of magnetic excitations with opposite magnon spin, allowing a spin current to be detected nonlocally. The AFM order and the generation of spin current can easily be controlled by an adjacent FM. Thereby, we show that AFMs have the potential to play an active role in spintronics
- …