Design and Analysis of User's Libraries for Parallel Computing based on the Internet


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 11, pp. 2932-2945, Nov. 1999
10.3745/KIPSTE.1999.6.11.2932,   PDF Download:

Abstract

Finite automaton is a mathematical model to represent a system with discrete inputs and outputs. Finite automata are a useful tool for solving problems such as text editor, lexical analyzer, and switching circuit. In this paper, given a deterministic finite automaton of an input string of length n and m states, we propose a constant time parallel algorithm that represents the transition states of finite automata and determines the acceptance of an input string on a reconfigurable mesh of size [nm/2] ?2m.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
P. S. Shin, C. M. Chung, H. S. Maeng, W. K. Hong, S. D. Kim, "Design and Analysis of User's Libraries for Parallel Computing based on the Internet," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 11, pp. 2932-2945, 1999. DOI: 10.3745/KIPSTE.1999.6.11.2932.

[ACM Style]
Pil Sup Shin, Chun Mok Chung, Hye Seon Maeng, Won Kee Hong, and Shin Dug Kim. 1999. Design and Analysis of User's Libraries for Parallel Computing based on the Internet. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 11, (1999), 2932-2945. DOI: 10.3745/KIPSTE.1999.6.11.2932.