AbstractWe associate to a Turing machine two dynamical systems which we call Turing machine with moving tape (TMT) and Turing machine with moving head (TMH). TMT are equivalent to generalized shifts of Moore (1990) and they include two-sided full shifts. TMH are shift-commuting maps of two-sided sofic systems. In both classes we characterize systems with the shadowing property, show that a bijective expansive TMT is conjugate to a subshift of finite type and that topological entropy of every TMH is zero. We conjecture that every TMT has a periodic point
A topological dynamical system was defined by Blanchard ([1]) to have topologically completely posit...
AbstractThis paper reasons about the need to seek for particular kinds of models of computation that...
Abstract—A Motzkin shift is a mathematical model for constraints on genetic sequences. In terms of t...
AbstractWe associate to a Turing machine two dynamical systems which we call Turing machine with mov...
International audienceA Turing machine is topologically transitive if every partial configuration — ...
Turing machines have been well studided in the context of Computability theory, looking at computati...
Abstract. We consider Turing machines (TM) from a dynamical sys-tem point of view, and in this conte...
AbstractWe consider the Turing Machine as a dynamical system and we study a particular partition pro...
AbstractWe describe Turing machines, tilings and infinite words as dynamical systems and analyze som...
We describe Turing machines, tilings and infinite words as dynamical systems and analyze some of the...
Part 2: Regular PapersInternational audienceWe consider Turing machines as actions over configuratio...
International audienceWe consider three problems related to dynamics of one-tape Turing machines: Ex...
AbstractDifferent characterizations of classes of shift dynamical systems via labeled digraphs, lang...
A dynamical systems based model of computation is studied. We demonstrate the computational capabili...
It is a great pleasure to write this tribute in honor of Scott A. Smolka on his 65th birthday. We re...
A topological dynamical system was defined by Blanchard ([1]) to have topologically completely posit...
AbstractThis paper reasons about the need to seek for particular kinds of models of computation that...
Abstract—A Motzkin shift is a mathematical model for constraints on genetic sequences. In terms of t...
AbstractWe associate to a Turing machine two dynamical systems which we call Turing machine with mov...
International audienceA Turing machine is topologically transitive if every partial configuration — ...
Turing machines have been well studided in the context of Computability theory, looking at computati...
Abstract. We consider Turing machines (TM) from a dynamical sys-tem point of view, and in this conte...
AbstractWe consider the Turing Machine as a dynamical system and we study a particular partition pro...
AbstractWe describe Turing machines, tilings and infinite words as dynamical systems and analyze som...
We describe Turing machines, tilings and infinite words as dynamical systems and analyze some of the...
Part 2: Regular PapersInternational audienceWe consider Turing machines as actions over configuratio...
International audienceWe consider three problems related to dynamics of one-tape Turing machines: Ex...
AbstractDifferent characterizations of classes of shift dynamical systems via labeled digraphs, lang...
A dynamical systems based model of computation is studied. We demonstrate the computational capabili...
It is a great pleasure to write this tribute in honor of Scott A. Smolka on his 65th birthday. We re...
A topological dynamical system was defined by Blanchard ([1]) to have topologically completely posit...
AbstractThis paper reasons about the need to seek for particular kinds of models of computation that...
Abstract—A Motzkin shift is a mathematical model for constraints on genetic sequences. In terms of t...