Browsing by Author "YOUNG, KR"

Now showing 1 - 1 of 1

SCANNING REGULAR LANGUAGES BY DUAL FINITE AUTOMATA
(1992-04-01)
WU, PC
;
WANG, FJ
;
YOUNG, KR
;
資訊科學與工程研究所
;
Institute of Computer Science and Engineering
A regular language is generally accepted by a single finite automaton. An approach of dual finite automata is presented here. An input string is scanned by two deterministic finite automata (DFA's): reading from the string's head and tail respectively. One of them accepts the regular language itself; the other accepts the language's reversal. Whether a string is accepted depends on the states of both automata, when their reading heads meet. Dual finite automata can be applied in compiler generation and parallel computing.