Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Computing and Communication Technologies
Article type: Research Article
Authors: Han, Nguyen Dinh | Vinh, Ho Ngoc | Thang, Dang Quyet | Huy, Phan Trung
Affiliations: Hung Yen University of Technology and Education, Dan Tien, Khoai Chau, Hung Yen, Viet Nam. hannguyen@utehy.edu.vn | Vinh University of Technology and Education, Hung Dung, Vinh, Viet Nam. hnvinh.skv@moet.edu.vn | Nam Dinh University of Technology and Education, Phu Nghia, Nam Dinh, Viet Nam. thangdgqt@gmail.com | Ha Noi University of Science and Technology, No. 1 Dai Co Viet, Ha Noi, Viet Nam. huyfr2002@yahoo.com
Note: [] Address for correspondence: Hung Yen University of Technology and Education, Dan Tien, Khoai Chau, Hung Yen, Viet Nam This work is partially supported by Vietnamese National Foundation for Science and Technology Development (NAFOSTED)
Abstract: The Sardinas-Patterson's test for codes has contributed many effective testing algorithms to the development of theory of codes, formal languages, etc. However, we will show that a modification of this test proposed in this paper can deduce more effective testing algorithms for codes. As a consequence, we establish a quadratic algorithm that, given as input a regular language X defined by a tuple (�, M, B), where � : A* → M is a monoid morphism saturating X, M is a finite monoid, $B \subseteq M$, X = �−1(B), decides in time complexity $\mathcal{O}(n^2)$ whether X is a code, where n = Card(M). Specially, n can be chosen as the finite index of X. A quadratic algorithm for testing of ◊-codes is also established.
Keywords: Sardinas-Patterson, quadratic algorithm, monoid, code, ◊-code
DOI: 10.3233/FI-2014-986
Journal: Fundamenta Informaticae, vol. 130, no. 2, pp. 163-177, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl