39 research outputs found
On the Structure of Covers of Sofic Shifts
A canonical cover generalizing the left Fischer cover to arbitrary sofic
shifts is introduced and used to prove that the left Krieger cover and the past
set cover of a sofic shift can be divided into natural layers. These results
are used to find the range of a flow-invariant and to investigate the ideal
structure of the universal C*-algebra associated to a sofic shift space.Comment: To appear in Documenta Mathematica. Section 2 has been shortened.
Three sections concerning the layered structure of the left Krieger cover and
the past set cover have been merged and rewritten. Non-essential examples
have been omitted. 21 pages, 8 figure
A certain synchronizing property of subshifts and flow equivalence
We will study a certain synchronizing property of subshifts called
-synchronization. The -synchronizing subshifts form a large
class of irreducible subshifts containing irreducible sofic shifts. We prove
that the -synchronization is invariant under flow equivalence of
subshifts. The -synchronizing K-groups and the -synchronizing
Bowen-Franks groups are studied and proved to be invariant under flow
equivalence of -synchronizing subshifts. They are new flow equivalence
invariants for -synchronizing subshifts.Comment: 28 page
Computations on Sofic S-gap Shifts
Let be an increasing finite or infinite subset of and the -gap shift associated to . Let
be the entropy function which will be
vanished at where is the entropy of the system. Suppose
is sofic with adjacency matrix and the characteristic polynomial
. Then for some rational function ,
. This will be explicitly determined.
We will show that or
when or
respectively. Here is the zeta function of . We will also compute
the Bowen-Franks groups of a sofic -gap shift.Comment: This paper has been withdrawn due to extending results about SFT
shifts to sofic shifts (Theorem 2.3). This forces to apply some minor changes
in the organization of the paper. This paper has been withdrawn due to a flaw
in the description of the adjacency matrix (2.3
On subshift presentations
We consider partitioned graphs, by which we mean finite strongly connected
directed graphs with a partitioned edge set . With additionally given a relation between
the edges in and the edges in , and denoting
the vertex set of the graph by , we speak of an an -graph . From -graphs we construct semigroups (with zero) that we call
-graph semigroups. We describe a method of presenting subshifts
by means of suitably structured labelled directed graphs with vertex set , edge set , and a label
map that asigns to the edges in labels in an -graph
semigroup . We call the presented subshift an -presentation.
We introduce a Property and a Property (c), tof subshifts, and we
introduce a notion of strong instantaneity. Under an assumption on the
structure of the -graphs we show for strongly instantaneous
subshifts with Property and associated semigroup , that Properties and (c) are
necessary and sufficient for the existence of an -presentation, to which the
subshift is topologically conjugate,Comment: 33 page