A Constant Time Algorithm for Deterministic Finite Automata Problem on a Reconfigurable Mesh
The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 11, pp. 2946-2953, Nov. 1999
10.3745/KIPSTE.1999.6.11.2946, PDF Download:
Abstract
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.
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]
Y. H. Kim, "A Constant Time Algorithm for Deterministic Finite Automata Problem on a Reconfigurable Mesh," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 11, pp. 2946-2953, 1999. DOI: 10.3745/KIPSTE.1999.6.11.2946.
[ACM Style]
Young Hak Kim. 1999. A Constant Time Algorithm for Deterministic Finite Automata Problem on a Reconfigurable Mesh. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 11, (1999), 2946-2953. DOI: 10.3745/KIPSTE.1999.6.11.2946.