摘要
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 1992: 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.
| 原文 | English |
|---|---|
| 頁（從 - 到） | 12-16 |
| 頁數 | 5 |
| 期刊 | ACM SIGPLAN Notices |
| 卷 | 27 |
| 發行號 | 4 |
| DOIs | |
| 出版狀態 | Published - 4 1月 1992 |