• Journal of KIISE:Software and Applications
• /
• v.41 no.7
• /
• pp.518-522
• /
• 2014

A single state parsing automaton has the characteristics of the decision of actions which do not depend on the history of the parsing paths but on the current state. The single state parsing automaton hence has the advantage of the reduced parsing time and a small memory requirement compared to those of the conventional LR automaton. However, currently, the grammar classes generating single state parsing automata have not been known. This paper deals with the grammar classes generating single state parsing automata; in addition, this paper gives the generating method of single state parsing automata of the grammar classes.

• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.78-86
• /
• 2014

Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.16 no.5 s.110
• /
• pp.495-502
• /
• 2006

A fault diagnosis method is developed in this study using automaton through quantization of vibration signals for normal and faulty conditions, respectively. Automaton is a kind of qualitative model which describes the system behaviour at the level of abstraction. The system behavior was extracted from the probability of the output sequence of vibration signals. The sequence was made as vibration levels by reconstructing the originally measured vibration signals. As an example, a fault diagnosis for the bearing of ATM machine was done, which detected the bearing fault with confident level compared to any other existing methods of kurtosis or spectrum analysis.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.4
• /
• pp.447-454
• /
• 2008

In this short note, we will point out and modify some logical errors in literatures about the theory of cellular automata.

• Journal of KIISE
• /
• v.44 no.3
• /
• pp.239-245
• /
• 2017

Probabilistic grammar is used in natural language processing, and the parse result of the grammar has to preserve the probability of the original grammar. As for the representative parsing method, LL parsing and LR parsing, the former preserves the probability information of the original grammar, but the latter does not. A characteristic of a probabilistic parsing automaton has been studied; but, currently, the generating model of probabilistic parsing automata has not been known. The paper provides a model of probabilistic parsing automata based on the single state parsing automata. The generated automaton preserves the probability of the original grammar, so it is not necessary to test whether or not the automaton is probabilistic parsing automaton; defining a probability function for the automaton is not required. Additionally, an efficient automaton can be constructed by choosing an appropriate parameter.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.585-596
• /
• 1998

Some new problems of the theory of the finite automata are considered. Applying the finite automata in various tasks of the formal languages theory is observed. Special proof of Kleene's theorem is obtained. This proof is used for the defining the star-height of the finite automaton. The proper-ties of the last object are considered. The star-height of the finite automaton is used for reformulating the star-height problem of regular expression for finite automata. The method of the reduction of the star-height problem to the task of making special finite automaton is obtained. This reformulating can help to solve the star-height problem by new way.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.357-377
• /
• 2000

A parallel communicating automata system is an accepting device based on the communications between more automata working in parallel. It consists of several automata corking independently but communicating with each other by request. We survey several variants of parallel communicating automata systems with respect to their computational power. Other aspects like decidability and complexity matters are also briefly discussed. Some open problem sand directions for future research are finally pointed out.

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

In this paper we shall give some decompositions derived from cyclic subautomata or neighborhoods of the automaton. Also we shall discuss some characterizations of cyclic automata when an automaton is maximal cyclic refinement. If m $\in$ M is totally reachable state, we shall see that {$mX^{\ast}$} is minimal.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.705-716
• /
• 2002

In this paper we shall introduce the algebraic structure of a tensor product for arbitrarily given automata, giving a defintion of the tensor product for automata. We introduce and study that for any set X there always exists a free automaton on X. The existence of a tensor product for automata will be investigated in the same way like modules do.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.379-392
• /
• 1999

The problem of the state-minimization for the nonde-terministic finite Rabin-Scott's automata is considered. A new algo-rithm for this problem is obtained. The obtained algorithm has the exponential effectiveness like the earlier-known algorithms for this problem. But each of previous algo-rithms amounts to the search of minimum generative system for local reaction of equal automaton of canonical form and unlike them we use in this paper two special function marking states of the given automaton.