Results 1  10
of
386
FiniteRepetition threshold for infinite ternary words
 WORDS, PRAGUE: CZECH REPUBLIC
, 2011
"... The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an aletter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a). This notion was introduced in 1972 by Dejean who ..."
Abstract
 Add to MetaCart
The exponent of a word is the ratio of its length over its smallest period. The repetitive threshold r(a) of an aletter alphabet is the smallest rational number for which there exists an infinite word whose finite factors have exponent at most r(a). This notion was introduced in 1972 by Dejean who
Recognizing finite repetitive scheduling patterns in manufacturing systems
 ASAP, University of Nottingham, United Kingdom
, 2003
"... Supported by the European Community Project IST200135304 (AMETIST). yParttime software architect at ASML. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Supported by the European Community Project IST200135304 (AMETIST). yParttime software architect at ASML.
Cooperation in the Finitely Repeated Prisoner's Dilemma
 Journal of Economic Theory
, 1982
"... A common observation in experiments involving finite repetition of the prisoners’ dilemma is that players do not always play the singleperiod dominant strategies (“finking”), but instead achieve some measure of cooperation. Yet finking at each stage is the only Nash equilibrium in the finitely repe ..."
Abstract

Cited by 388 (1 self)
 Add to MetaCart
A common observation in experiments involving finite repetition of the prisoners’ dilemma is that players do not always play the singleperiod dominant strategies (“finking”), but instead achieve some measure of cooperation. Yet finking at each stage is the only Nash equilibrium in the finitely
Computable Enumeration And The Problem Of Repetition
, 1995
"... The thesis is concerned with the question of characterizing those computably enumerable (c.e.) classes of computably enumerable sets which have a computable enumeration without repetition (an injective enumeration). This problem can be traced back to 1958, when Friedberg proved that the class of all ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of all computably enumerable sets can be injectively enumerated. We go beyond the scope of the literature by extending the study to the problem of characterizing the c.e. classes which are c.e. with a bounded number of repetitions and with finite repetitions. An investigation of the question restricted
Repetitions in Text and Finite Automata 1
"... Abstract: A general way to find repetitions of factors in a given text is shown. We start with a classification of repetitions. The general models for finding exact repetitions in one string and in a finite set of strings are introduced. It is shown that dsubsets created during determinization of n ..."
Abstract
 Add to MetaCart
Abstract: A general way to find repetitions of factors in a given text is shown. We start with a classification of repetitions. The general models for finding exact repetitions in one string and in a finite set of strings are introduced. It is shown that dsubsets created during determinization
Repetitive Delone sets and quasicrystals
, 1999
"... This paper considers the problem of characterizing the simplest discrete point sets that are aperiodic, using invariants based on topological dynamics. A Delone set of finite type is a Delone set X such that X − X is locally finite. Such sets are characterized by their patchcounting function NX(T) ..."
Abstract

Cited by 26 (0 self)
 Add to MetaCart
(T) of radius T being finite for all T. A Delone set X of finite type is repetitive if there is a function MX(T) such that every closed ball of radius MX(T)+T contains a complete copy of each kind of patch of radius T that occurs in X. This is equivalent to the minimality of an associated topological dynamical
Fewest repetitions in infinite binary words
, 2012
"... A square is the concatenation of a nonempty word with itself. A word has period pifits letters at distance pmatch. The exponentofanonempty word is the quotient of its length over its smallest period. In this article we give a proof of the fact that there exists an infinite binary word which contains ..."
Abstract
 Add to MetaCart
/3 introduces what we call the finiterepetition threshold of the binary alphabet. We conjecture it is 7/4 for the ternary alphabet, like its repetitive threshold.
Hilbert schemes, polygraphs, and the Macdonald positivity conjecture
 J. Amer. Math. Soc
"... The Hilbert scheme of points in the plane Hn = Hilb n (C2) is an algebraic variety which parametrizes finite subschemes S of length n in C2. To each such subscheme S corresponds an nelement multiset, or unordered ntuple with possible repetitions, σ(S) =[P1,...,Pn] of points in C2,wherethePiare the ..."
Abstract

Cited by 157 (4 self)
 Add to MetaCart
The Hilbert scheme of points in the plane Hn = Hilb n (C2) is an algebraic variety which parametrizes finite subschemes S of length n in C2. To each such subscheme S corresponds an nelement multiset, or unordered ntuple with possible repetitions, σ(S) =[P1,...,Pn] of points in C2,wherethe
Cooperation, Repetition, and Automata
 Cooperation: Game Theoretic Approaches, NATO ASI Series F
, 1995
"... This talk studies the implications of bounding the complexity of players' strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it. A finite automaton has a finite number of states and an initial state. It prescri ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This talk studies the implications of bounding the complexity of players' strategies in long term interactions. The complexity of a strategy is measured by the size of the minimal automaton that can implement it. A finite automaton has a finite number of states and an initial state
NonRepetitive Binary Sequences
"... An infinite sequence on two symbols is constructed with no three adjacent identical blocks of symbols and no two adjacent identical blocks of four or more symbols, refuting a conjecture of Entringer, Jackson and Schatz. It is further demonstrated that there is no infinite sequence two symbols with n ..."
Abstract
 Add to MetaCart
with no three adjacent identical blocks of symbols and no two adjacent identical blocks of three or more symbols. Let M be a finite set of symbols (an alphabet), and let Seq(M) denote the set of all finite or infinite sequences of one or more elements of M. The finite sequences in Seq(M) are also called blocks
Results 1  10
of
386