کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
437494 690149 2016 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the permutation complexity of the Cantor-like sequences
ترجمه فارسی عنوان
در پیچیدگی جایگزینی توالی های کانتور مانند
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی


• We obtain the permutation complexity of Cantor-like sequences.
• We give a precise recurrence relation for the permutation complexity of Cantor-like sequences.
• We give a generalized automaton for the first differences of the permutation of Cantor-like sequences.

In this paper, we give a precise formula for the permutation complexity of Cantor-like sequences, which are non-uniformly recurrent automatic sequences. Since the sequences are automatic, as it was proved by Charlier et al. in 2012, the permutation complexity of each of them is a regular sequence. We give a precise recurrence relation and a generalized automaton for it.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 616, 22 February 2016, Pages 100–110
نویسندگان
, , , ,