30 search results - page 1 / 6 » Combinations of Context-Free Shifts and Shifts of Finite Typ... |
BIOCOMP
2008
13 years 6 months ago
2008
A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzki...
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the ...
CSR
2010
Springer
13 years 8 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
JSYML
2010
12 years 11 months ago
2010
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we...