Automatic Groups Associated with Word Orders Other than Shortlex

نویسندگان

چکیده

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

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

منابع مشابه

Automatic Groups Associated with Word Orders Other than Shortlex

The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups associated with other word orders (the algorithm has now been implemented) and reports on the use of the algorithm for specific examples; in particular a very natu...

متن کامل

Artin groups of large type are shortlex automatic with regular geodesics

We prove that any Artin group of large type is shortlex automatic with respect to its standard generating set, and that the set of all geodesic words over the same generating set satisfies the Falsification by FellowTraveller Property (FFTP) and hence is regular.

متن کامل

Secret Sharing using Non-Commutative Groups and the Shortlex Order

In this paper we review the Habeeb-Kahrobaei-Shpilrain secret sharing scheme [5] and introduce a variation based on the shortlex order on a free group. Drawing inspiration from adjustments to classical schemes, we also present a method that allows for the protocol to remain secure after multiple secrets are shared.

متن کامل

Adjusting Word Embeddings with Semantic Intensity Orders

Semantic lexicons such as WordNet and PPDB have been used to improve the vector-based semantic representations of words by adjusting the word vectors. However, such lexicons lack semantic intensity information, inhibiting adjustment of vector spaces to better represent semantic intensity scales. In this work, we adjust word vectors using the semantic intensity information in addition to synonym...

متن کامل

Automatic Linear Orders

We study model-theoretic properties of automatic linear orders, in particular issues of categoricity and suborder complexity. We prove that the growth rate of the domain of a presentation of a linear order dictates the complexity. These results highlight key similarities and differences between automatic structures and other structures of effective mathematics.

متن کامل

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


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

ژورنال

عنوان ژورنال: International Journal of Algebra and Computation

سال: 1998

ISSN: 0218-1967,1793-6500

DOI: 10.1142/s0218196798000272