Skip to content
Research Article Open access CC BY 3.0

Generalizing the Asymmetric Run-length-limited Systems

D. Ahmadi Dastjerdi, S. Jangjooye Shaldehi

Journal of Advances in Mathematics and Computer Science · pp. 1134–1145 · Published 19 Feb 2014

10.9734/BJMCS/2014/7434

Abstract

For i = 1; 2, if Xi is a synchronized system generated by Vi = {ui ∝I : ∝I ui  ∝I  ∈ B (Xi), ∝I  ui }  where _i is a synchronizing word for Xi, then a natural generalization of an asymmetric-RLL(d1; k1; d0; k0) systems is a coded system Z generated by   We investigate the dynamical properties of Z. We show that Z is sofic or has specification with variable gap length (SVGL) if and only if X1 and X2 are so. Also, if Z is SFT or AFT, then X and Y are SFT or AFT respectively and sufficient conditions for the converse will be given.

Shift of finite type sofic almost-finite-type synchronized coded system.

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

8

Page views

0

PDF downloads

1

Outbound clicks

0

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.