Related papers: Symbolic dynamics
We use symbolic dynamics to study discrete-time dynamical systems with multiple time delays. We exploit the concept of avoiding sets, which arise from specific non-generating partitions of the phase space and restrict the occurrence of…
We study the action of a relatively hyperbolic group on its boundary, by methods of symbolic dynamics. Under a condition on the parabolic subgroups, we show that this dynamical system is finitely presented. We give examples where this…
This paper gives a concise introduction into the basic theory of {\omega}-automata (as of March 2014). The starting point are the different types of recurrence conditions, modes of operation (deterministic, nondeterministic, alternating…
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the number of states, the maximal number of transitions exiting a…
The paper is concerned with defining the electrical signals and their models. The delays are discussed, the asynchronous automata - which are the models of the asynchronous circuits - and the examples of the clock generator and of the R-S…
In this paper, we introduce the notion of strongly automatic semigroup, which implies the usual notion of auto- maticity. We focus on semigroups of \beta-adics developpements, for which we obtain a criterion of strong automaticity.
The theory of finite automata applies to the study on relations of multiple zeta values.
This note clarifies the concept of syntax and semantics and their relationships. Today, a lot of confusion arises from the fact that the word "semantics" is used in different meanings. We discuss a general approach at defining semantics…
This is a tutorial on finite automata. We present the standard material on determinization and minimization, as well as an account of the equivalence of finite automata and monadic second-order logic. We conclude with an introduction to the…
The action of any group on itself by conjugation and the corresponding conjugacy relation play an important role in group theory. There have been many attempts to find notions of conjugacy in semigroups that would be useful in special…
We introduced a family of infinite graphs directly associated with a class of von Neumann automaton model A_{G}. These are finite state models used in symbolic dynamics: stimuli models and in control theory. In the context of groupoid von…
We analyze the role played by local translational symmetry in the context of gauge theories of fundamental interactions. Translational connections and fields are introduced, with special attention being paid to their universal coupling to…
We consider families of coded systems that contain the Dyck shifts and that are closed under topological conjugacy. We introduce a notion of hyposynchronization of subshifts. We introduce a notion of restricted complexity of…
The thesis is devoted to relations between algebra and symbolic dynamics. Various generalisations of sturmian sequences are discoursed. Let $W$ be an infinite word over a finite alphabet $A$. The combinatorial criteria of existence of…
We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…
This is an expository plus research paper which mainly exposes preliminary connection and contrast between classical complex dynamics and semigroup dynamics of holomorphic functions. Classically, we expose some existing results of rational…
We formulate general rules for a coarse-graining of the dynamics, which we term `symbolic dynamics', of feedback networks with monotone interactions, such as most biological modules. Networks which are more complex than simple cyclic…
Symbolic dynamics, which partitions an infinite number of finite-length trajectories into a finite number of trajectory sets, describes the dynamics of a system in a simplified and coarse-grained way with a limited number of symbols. The…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…