• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.559-569
• /
• 2004

In this paper we shall discuss the quasi-perfect automata associated with power automata. We shall give the fact that its power automaton is invertible if an automaton A is quasi-perfect. Moreover, some subgroups and normal subgroups of the characteristic semigroup X(M) will have the very interesting parts in their structures.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.571-583
• /
• 2004

In this paper we shall discuss the quasi-perfect automata associated with power automata. We shall give the fact that x(M)/ HX is normal subgroup of the characteristic semigroup x(M) if the automaton A is quasi-perfect and x(M)/HX = x$(M)_H$ if A is perfect. Moreover, it is a very interesting part that x$(M)_H$ is conjugate to x$(M)_{Ha}$ for every a $\in$ X. Also we shall give a characterization of Ha = Hb for x$(M)_H$.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.779-786
• /
• 2005

In this paper we shall discuss some properties derived from the characteristic S-automaton $_x(S)_M$, using the fact that ${\mu}_S$ is an equivalence relation on M. When $L_{m}:S{\rightarrow}M$ is a left translation and $L_{M}$ is a collection of $L_{m}'s$, we shall show $_x(S)_{M}{\cong}L_{M}$. If S is commutative, we have $_x(S)_{M{\times}N{\cong}L_{M{\times}N}$. Moreover when M and N are perfect, we have $L_{M{\times}N}{\cong}L_{M}{\times}L_{N}$ and $_x(S)_{M{\times}N}{\cong}_x(S)_{M}{\times}_x(S)_N$.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1047-1054
• /
• 2004

One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.