Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

BIOCOMP
2008

favoriteEmaildiscussreport

101views Bioinformatics» more BIOCOMP 2008»

Combinations of Context-Free Shifts and Shifts of Finite Type

13 years 6 months ago

Combinations of Context-Free Shifts and Shifts of Finite Type

Download ita.ucsd.edu

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 Motzkin shift is sofic. In terms of the mathematical language theory, they are non-regular and context free languages. Therefore we can not use the Perron-Frobenius theory to calculate capacities of these constraints. O. Milenkovic has shown that the DSV (Del`est-Sch

Hiroshi Kamabe

Real-time Traffic

BIOCOMP 2008 | Bioinformatics | Context Free Languages | Dyck Shift | Motzkin Shift |

claim paper

Related Content

» Decidability of Conjugacy of TreeShifts of Finite Type

» On the Period of a PeriodicFiniteType Shift

» Sofic and Almost of Finite Type TreeShifts

» The bounded functional interpretation of the double negation shift

» A new class of linear feedback shift register generators

» On Negative Bases

» Symbolic Dynamics from homoclinic tangles

» Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis

» Feature Sensitive Mesh Segmentation with Mean Shift

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	BIOCOMP
Authors	Hiroshi Kamabe

Comments (0)