Journal:Theoretical Computer Science

Key Words:Cantor-like sequence Factor complexity Permutation complexity Regular sequence DFAO

Abstract: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.

First Author:吕小涛

Indexed by:Journal paper

Discipline:Natural Science

First-Level Discipline:Mathematics

Document Type:J

Translation or Not:no

Date of Publication:2016-01-01

Included Journals:SCI