Finite complete rewriting systems for the Jantzen monoid and the greendlinger group
نویسندگان
چکیده
منابع مشابه
Complete Rewriting System for the Chinese Monoid
In this paper we are interested in the Chinese monoid and show that the Chinese monoid has complete rewriting system. Mathematics Subject Classification: 16S15; 20F05; 20F10; 20M50; 68Q42
متن کاملCrystal bases , finite complete rewriting systems , and
This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homolog...
متن کاملthe search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولOn finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation type, being automatic, and being biautomatic are investigated for this class of monoids. The first main result shows that for any consistent combination of t...
متن کاملFinite Complete Rewriting Systems and Finite Derivation Type for Small Extensions of Monoids
Let S be a monoid and let T be a submonoid of nite index in S. The main results in this paper state that S can be presented by a nite complete rewriting system if T can, and S has nite derivation type if T has.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90044-6