منابع مشابه
Pattern Avoidance in Partial Permutations
Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols π = π1π2 · · · πn in which each of the symbols from the set {1, 2, . . . , n− k} appears exactly once, while the remaining k symbols of π are “holes”. A. Claesson, V. Jeĺınek and S. Kitaev were supported by the Icelandic Re...
متن کاملPartial Matchings and Pattern Avoidance
A partition of a finite set all of whose blocks have size one or two is called a partial matching. Here, we enumerate classes of partial matchings characterized by the avoidance of a single pattern, specializing a natural notion of partition containment that has been introduced by Sagan. Let vn(τ) denote the number of partial matchings of size n which avoid the pattern τ . Among our results, we...
متن کاملPattern avoidance in partial permutations ( extended abstract )
Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols π = π1π2 · · ·πn in which each of the symbols from the set {1, 2, . . . , n− k} appears exactly once, while the remaining k symbols of π are “holes”. We introduce pattern-avoidance in partial permutations and prove that mos...
متن کاملOn Avoidance Learning with Partial Observability
We study a framework where agents have to avoid aversive signals. The agents are given only partial information, in the form of features that are projections of task states. Additionally, the agents have to cope with non-determinism, defined as unpredictability on the way that actions are executed. The goal of each agent is to define its behavior based on featureaction pairs that reliably avoid...
متن کاملAbelian Pattern Avoidance in Partial Words
Pattern avoidance is an important topic in combinatorics on words which dates back to the beginning of the twentieth century when Thue constructed an infinite word over a ternary alphabet that avoids squares, i.e., a word with no two adjacent identical factors. This result finds applications in various algebraic contexts where more general patterns than squares are considered. On the other hand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Experimental Analysis of Behavior
سال: 1975
ISSN: 0022-5002
DOI: 10.1901/jeab.1975.23-437