Scanning Regular Languages by Dual Finite Automata

Pei Chi Wu, Feng-Jian Wang, Kai Ru Young

研究成果: Article同行評審

摘要

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 一月 1992

指紋

深入研究「Scanning Regular Languages by Dual Finite Automata」主題。共同形成了獨特的指紋。

引用此