The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)
- Volume 6 Issue 11
- /
- Pages.2946-2953
- /
- 1999
- /
- 1226-9190(pISSN)
A Constant Time Algorithm for Deterministic Finite Automata Problem on a Reconfigurable Mesh
재구성 가능한 메쉬에서 결정적 유한 자동장치 문제에 대한 상수시간 알고리즘
Abstract
Finite automation 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]
Keywords