• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.1009-1019
• /
• 2001

We introduce the concepts of TL-finite state machine, TL-kernel and TL-subfinite state machines, TL-kernel and TL-subfinite state machine and obtain some results concerning them.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.2
• /
• pp.173-177
• /
• 2001

We introduce cascade products, wreath products, sums and joins of TL-finite state machines and investigate their algebraic structures. Also we study the relations with other products of TL-finite state machines.

• Journal of Korea Multimedia Society
• /
• v.16 no.1
• /
• pp.75-86
• /
• 2013

This paper presents a technique to implement embedded systems using interrupts of the one-chip microcontroller with many peripherals based on a multiple finite state machines model. The multiple finite state machine model utilizes the structure of FSMD used for hardware design and the features of flow control by interrupts. The main finite state machine corresponds to the main program and the sub-state machines corresponds to the interrupt subroutines. Therefore, interrupts from the peripherals can be processed immediately in the sub-state machines. The request and reply variables are used to interface between the finite state machines. Additional operating system is not necessary for the context switching between the main state machine and the sub-state machine, because the flow-control caused by interrupt can be replaced with the switching. An embedded system modeled on multiple finite state machine with ASM charts can be easily implemented by the conversion of ASM charts into C-language programs. This implementation technique can be easily adopted to the hardware oriented embedded systems because of the detail description of the model and the fast response to the interrupt events in the sub-state machine.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.457-466
• /
• 2005

In this paper we present the concepts of fuzzy submachine, which are the generalized form of crisp submachine of a fuzzy finite state machine. Also we extend the concepts of system of generators to fuzzified form.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.315-325
• /
• 2006

The notion of intuitionistic fuzzy finite switchboard state machines and (strong) homomorphisms of intuitionistic fuzzy finite state machines are introduced, and related properties are investigated. After we give a congruence relation on the set of all words of elements of X of finite length, the quotient structure is discussed. We show that the family of equivalence classes is a finite semigroup with identity.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.80-82
• /
• 1998

we introduce the concept of coverings, direct products, cascade products and wreath products of T-fuzzy finite state machines and investigate their algebraic structures.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.2
• /
• pp.156-160
• /
• 2001

In this paper we define fuzzy subsystems of a fuzzy finite state machine by using maps $S^{\alpha}$ of each state subset to its all $\alpha$-successors, which is a natural generalization of crisp submachines as fuzzy. And the corresponding concepts are also examined. also examined.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.117-134
• /
• 1997

In this paper we introduce the notions of TL-subsystems strong TL-subsystems and discuss their basic properties.

• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.7
• /
• pp.760-770
• /
• 2013

Detecting grammatical errors from a text is a long-history application. In this paper, we compare the performance of two grammatical error detection techniques, which are implemented as a sub-module of an automated English scoring system. One is to use a full syntactic parser, which has not only grammatical rules but also extra-grammatical rules in order to detect syntactic errors while paring. The other one is to use a finite state machine which can identify an error covering a small range of an input. In order to compare the two approaches, grammatical errors are divided into three parts; the first one is grammatical error that can be handled by both approaches, and the second one is errors that can be handled by only a full parser, and the last one is errors that can be done only in a finite state machine. By doing this, we can figure out the strength and the weakness of each approach. The evaluation results show that a full parsing approach can detect more errors than a finite state machine can, while the accuracy of the former is lower than that of the latter. We can conclude that a full parser is suitable for detecting grammatical errors with a long distance dependency, whereas a finite state machine works well on sentences with multiple grammatical errors.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.53-61
• /
• 2001

We introduce sums and joins of fuzzy finite state machines and investigate their algebraic structures.