检索结果-内蒙古大学图书馆

AN EQUIVALENCE RELATION ON suffix codeS DEFINED BY GENERALIZED REGULAR LANGUAGES

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1990年第1-4期35卷 15-24页

作者： ZHANG, SH Department of Mathematics and Statistics Simon Fraser University Burnaby B.C. V5A 1S6 Canada

LetXbe a finite alphabet andX∗the free monoid generated byX. S(X) denotes the free monoid of all suffix codes overXunder concatenation. ForSεS(X) andL⊆X∗, the right congruence ∼s,loverX∗is defined by. A languageL⊆X∗isS-regular iff ∼S,Lis of finite index. For ***. The relation ≈is an equivalence relation over S(X). In this note, we give a characterization of ≈. Some properties of ≈ are given. In particular, we show that ≈ is a right congruence of infinite index over S(X).

关键词： Free monoid suffix code maximal suffix code regular language s-regular language equivalence relation right (left) congruence F.4.3 E.4

来源：评论

学校读者我要写书评

暂无评论

Composition of strongly infix codes

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1998年第6期E81D卷 609-611页

作者： Moriya, T Kokushikan Univ Fac Engn Dept Elect Engn Tokyo 1548515 Japan

We introduce a strongly infix code. A code X is a strongly infix code if X is an infix code and any catenation of two words in X has no proper factor in X, which is neither a left factor nor a right factor. We show that the class of strongly infix codes is closed under composition, and, as the dual result, that the property to be strongly infix is inherited by a component of a decomposition.

关键词： prefix code suffix code infix code composition of codes

来源：评论

学校读者我要写书评

暂无评论

Power-properties of codes

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2002年第3期E85D卷 577-579页

作者： Moriya, T Kokushikan Univ Fac Engn Dept Elect Engn Tokyo 1548515 Japan

We consider the following three statements for a code L. (P1) For every n greater than or equal to 2, both w(n) is an element of L-n and w(n+1) is an element of Ln+1 imply w is an element of L. (P2) For every n greater than or equal to 2, if w(n) is an element of L-n, then w is an element of L. (P3) For every m, k greater than or equal to 2 with m less than or equal to k w(k) is an element of L-m, implies w is an element of L. First we show that for every code L, P1 holds. Next we show that for every infix code L, P2 holds, and that a code L is an infix code iff P2 holds and L is a weakly infix code. Last we show that for every strongly infix code L, P3 holds, and that a code L is a strongly infix code iff P3 holds and L is a hyper infix code.

关键词： prefix code suffix code infix code strongly infix code

来源：评论

学校读者我要写书评

暂无评论

A note on parses of codes

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2003年第11期E86D卷 2472-2474页

作者： Moriya, T Kokushikan Univ Dept Elect Engn Fac Engn Tokyo 1548515 Japan

In this note, we present some results about parses of codes. First we present a sufficient condition of a bifix code to have the bounded indicator. Next we consider a proper parse, introduced notion. We prove that for a strongly infix code, the number of proper parses is at most three under some condition. We also prove that if a code X has a unique proper parse for each word under the same condition, then X is a strongly infix code.

关键词： bifix code parse prefix code suffix code strongly infix code

来源：评论

学校读者我要写书评

暂无评论

Syntactic congruences of codes

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2001年第3期E84D卷 415-418页

作者： Moriya, T Kataoka, I Kokushikan Univ Fac Engn Dept Elect Engn Tokyo 1548515 Japan

We consider syntactic congruences of some codes. As a main result, for an infix code L, it is proved that the following (i) and (ii) are equivalent and that (iii) implies (i), where P-L is the syntactic congruence of L. (i) L is a P-L2-class. (ii) L-m is a P-Lk-class, for given two integers m and k with 1 less than or equal to m less than or equal to k. (iii)L* is a P-L*-class. Next we show that every (i), (ii) and (iii) holds for a strongly infix code L. Moreover we consider properties of syntactic conguences of a residue W(L) for a strongly outfix code L.

关键词： prefix code suffix code infix code outfix code syntactic congruence

来源：评论

学校读者我要写书评

暂无评论

delta-codes and delta-languages

引用

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY 2005年第3期8卷 381-394页

作者： Fan, Chen-Ming Shyr, H. J. Natl Chin Yi Univ Technol Dept Informat Management 35Lane 215Sec 1Chung Shan Rd Taichung 411 Taiwan Natl Chung Hsing Univ Dept Appl Mathemat Taichung 402 Taiwan

The purpose of this paper is to divide the monoid of languages M into a partition and study some combinatorial properties of each cell in the partition. We investigate some properties of delta-languages and in particular, we give a characterization of two-element delta-codes. We also consider the properties of the regular gamma-languages (xy)* x for any x, y is an element of X *.

关键词： code prefix code suffix code bifix code delta-language regular delta-language delta-code

来源：评论

学校读者我要写书评

暂无评论

Ibm :: 24Xx :: 2415 :: S123-0454-3 2415 Magnetic Tape Unit and Control Parts Catalog 1969

引用

2016年

Ibm :: 24Xx :: 2415 :: S123-0454-3 2415 Magnetic Tape Unit and Control Parts Catalog 1969 by published by

关键词： asm assembly cable capacitor assembly catalog chassis code component parts control cycle detail breakdown fcr fcr detail fcr illustration figure higher assembly list magnetic number description parts power supply s123-0454-3 screw terminals suffix code usable

来源：评论

学校读者我要写书评

暂无评论

A class by principal congruence of a syntactically embedded language

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2007年第6期E90D卷 975-978页

作者： Moriya, Tetsuo Kokushikan Univ Fac Engn Dept Elect Engn Tokyo 1548515 Japan

In this paper, we introduce a syntactically embedded (s-embedded) language, and consider its principal congruence. The following three results are proved, where P-L is the principal congruence of a language L, and W(L) is the residual of L. (1) For a language K, s-embedded in M, K is equal to a I'm class. (2) For a language K, s-embedded in an infix language M, K is equal to a P-w(m) class. (3) For a nonempty s-embedded language L, if L is double-unitary, then L is equal to a Pw(m) class. From the above results, we can obtain those for principal congruence of some codes. For example, L-n is equal to a P-L(n-1) class for an inter code L of index n.

关键词： prefix code suffix code infix code conuna-free code inter code principal congruence

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：