Syntactic Complexity of Ultimately Periodic Sets of Integers
نویسندگان
چکیده
We compute the cardinality of the syntactic monoid of the language 0∗ rep b (mN) made of base b expansions of the multiples of the integer m. We also give lower bounds for the syntactic complexity of any (ultimately) periodic set of integers written in base b. We apply our results to some well studied problem: decide whether or not a brecognizable sets of integers is ultimately periodic.
منابع مشابه
Syntactic Complexity of Ultimately Periodic Sets of Integers and Application to a Decision Procedure
We compute the cardinality of the syntactic monoid of the language 0∗ repb(mN) made of base b expansions of the multiples of the integer m. We also give lower bounds for the syntactic complexity of any (ultimately) periodic set of integers written in base b. We apply our results to a well studied problem: decide whether or not a b-recognizable set of integers is ultimately periodic.
متن کاملAn efficient algorithm to decide periodicity of b-recognisable sets using LSDF convention
Given an integer base b > 1, a set of integers is represented in base b by a language over {0, 1, ..., b − 1}. The set is said to be b-recognisable if its representation is a regular language. It is known that ultimately periodic sets are b-recognisable in every base b, and Cobham’s theorem implies the converse: no other set is b-recognisable in every base b. We are interested in deciding wheth...
متن کاملNecessary and sufficient conditions for a sum-free set of positive integers to be ultimately periodic
Cameron has introduced a natural bijection between the set of one way infinite binary sequences and the set of sum-free sets (of positive integers), and observed that a sum-free set is ultimately periodic only if the corresponding binary sequence is ultimately periodic. He asked if the converse also holds. In this paper we present necessary and sufficient conditions for a sum-free set to be ult...
متن کاملThe Relationship between Syntactic and Lexical Complexity in Speech Monologues of EFL Learners
: This study aims to explore the relationship between syntactic and lexical complexity and also the relationship between different aspects of lexical complexity. To this end, speech monologs of 35 Iranian high-intermediate learners of English on three different tasks (i.e. argumentation, description, and narration) were analyzed for correlations between one measure of sy...
متن کاملCryptanalysis of GSM encryption algorithm A5/1
The A5/1 algorithm is one of the most famous stream cipher algorithms used for over-the-air communication privacy in GSM. The purpose of this paper is to analyze several weaknesses of A5/1, including an improvement to an attack and investigation of the A5/1 state transition. Biham and Dunkelman proposed an attack on A5/1 with a time and data complexity of 239.91and 221.1, ...
متن کامل