Effective constructions in well-partially- ordered free monoids

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morita theorems for partially ordered monoids

Two partially ordered monoids S and T are called Morita equivalent if the categories of right S-posets and right T -posets are Pos-equivalent as categories enriched over the category Pos of posets. We give a description of Pos-prodense biposets and prove Morita theorems I, II, and III for partially ordered monoids.

متن کامل

Injective Hulls of Partially Ordered Monoids

We find the injective hulls of partially ordered monoids in the category whose objects are po-monoids and submultiplicative order-preserving functions. These injective hulls are with respect to a special class of monics called “embeddings”. We show as well that the injective objects with respect to these embeddings are precisely the quantales.

متن کامل

On Well Quasi Orders of Free Monoids

The paper investigates down-sets associated to well quasi orders. Of particular language-theoretic interest is the quasi order u s v (resp.u P v) of u being a subword (resp. a Parikh subword) of v, as well as their inverses. We establish a number of results about the regularity and e ective regularity of the down-sets, in particular, a general condition for the e ective regularity of the down-s...

متن کامل

Partially Well-Ordered Closed Sets of Permutations

It is known that the \pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally de ned subsets of permutations are partially well-ordered, in which case they have a strong nite basis property. Several classes are proved to be partially well-ordered under pattern containment. Conversely, a number of new antichains are exhibited that give some insight as...

متن کامل

Efficient Solution to Some Problems in Free Partially Commutative Monoids

In theoretical computer science, and, in particular, in automata and formal language theory, questions arise concerning words and sets of words in free monoids. Results and techniques from the study of the combinatorial algebra of the free monoid have provided an “algebraic” basis for dealing with many of these questions. In recent years there has been increasing interest in properties of words...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1978

ISSN: 0012-365X

DOI: 10.1016/0012-365x(78)90156-5