Sets which satisfy certain avoidability conditions
نویسندگان
چکیده
منابع مشابه
Testing avoidability on sets of partial words is hard
We prove that the problem of deciding whether a finite set of partial words is unavoidable is NP-hard for any alphabet of size larger or equal to two, which is in contrast with the well known feasability results for unavoidability of a set of full words. We raise some related questions on avoidability of sets of partial words.
متن کاملPhysical Variational Principles Which Satisfy the Palais-smale Condition
1. Using variational techniques we have found conditions which insure the existence of trajectories to conservative dynamical systems which wind around singularities of the potential and are of the following four types: (la) periodic trajectories cutting arbitrary small neighborhoods of the singularities; (lb) periodic trajectories having arbitrary given period; (2a) trajectories joining two fi...
متن کاملPC program for analyzing one-sample longitudinal data sets which satisfy the two-stage polynomial growth curve model.
The two-stage polynomial growth curve model is described and a GAUSS program to perform the associated computations is documented and made available to interested readers. The two-stage model is similar to that considered by us earlier (Schneiderman and Kowalski: American Journal of Physical Anthropology 67:323-333, 1985; American Journal of Human Biology 1:31-42, 1989), i.e., it is appropriate...
متن کاملAvoidability of circular formulas
Clark has defined the notion of n-avoidance basis which contains the avoidable formulas with at most n variables that are closest to be unavoidable in some sense. The family Ci of circular formulas is such that C1 = AA, C2 = ABA.BAB, C3 = ABCA.BCAB.CABC and so on. For every i 6 n, the n-avoidance basis contains Ci. Clark showed that the avoidability index of every circular formula and of every ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky a fysiky
سال: 1938
ISSN: 1802-114X
DOI: 10.21136/cpmf.1938.123857