Keyword: Strong Codes : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 1of1

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

articleNo Access
Some Properties of Extractable Codes and Insertable Codes
- Yoshiyuki Kunimochi
International Journal of Foundations of Computer Science01 Feb 2016
Preview Abstract
This paper deals with insertability and mainly extractablity of codes. A code C is called insertable (or extractable) if the free submonoid C^* generated by C satisfies if z, $x y \in C^{*}$ $x y \in C^{*}$ implies $x zy \in C^{*}$ $x zy \in C^{*}$ (or z, $x zy \in C^{*}$ $x zy \in C^{*}$ implies $x y \in C^{*}$ $x y \in C^{*}$ ). We show that a finite insertable code is a full uniform code. On the other hand there are many finite extractable codes which are not full uniform codes. We cannot still characterize the structures of infinite extractable codes. Here we give some results on the class of infix extractable codes. First, we consider a necessary and sufficient condition whether a given infix code C is extractable or not by using the syntactic graph of the code. Secondly, we investigate the extractability for the families of other related bifix codes. We newly define the bifix codes, called e(m)-codes and $\bar{e}$ $\bar{e}$ -codes, and refer to the extractability of them.

1