• Journal of applied mathematics & informatics
• /
• 제8권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.

• 한국지능시스템학회논문지
• /
• 제11권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.

• 한국멀티미디어학회논문지
• /
• 제16권1호
• /
• pp.75-86
• /
• 2013

본 논문은 많은 주변장치와 인터페이스 되는 단일칩 마이크로컨트롤러로 구현되는 임베디드시스템을 인터럽트를 사용하여 다중 유한상태기계로 모델링하고 구현하는 방법을 제시한다. 다중 상태기계 모델은 하드웨어설계에 사용되는 FSMD 구조와 인터럽트에 의한 흐름제어 특징을 이용한다. 주 프로그램은 주상태기계에 대응하고, 부상태기계는 인터럽트 서비스루틴에 대응한다. 따라서 주변장치에서 발생하는 인터럽트는 부상태기계에서 신속히 처리될 수 있다. 유한상태기계 사이의 인터페이스는 요청과 응답 변수를 사용한다. 주상태기계와 부상태기계 사이의 콘텍스트 스위칭은 인터럽트에 의한 하드웨어 흐름제어로 대치될 수 있어 별도의 운영체제가 필요하지 않다. ASM 차트를 사용하여 다중 유한상태기계로 모델링된 임베디드시스템은 C언어 프로그램으로 변환시켜 쉽게 구현될 수 있다. 이 구현 방법은 모델링이 구체적고 부상태기계에서 인터럽트에 신속히 반응할 수 있어 하드웨어가 많이 사용되는 내장형시스템에 쉽게 적용될 수 있다.

• Journal of applied mathematics & informatics
• /
• 제19권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
• /
• 제20권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• 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.

• 한국지능시스템학회논문지
• /
• 제11권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
• /
• 제4권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
• /
• 제37권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
• /
• 제5권2호
• /
• pp.53-61
• /
• 2001

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