Scanning Regular Languages by Dual Finite Automata

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

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)12-16
Number of pages5
JournalACM SIGPLAN Notices
Issue number4
StatePublished - 4 Jan 1992


Dive into the research topics of 'Scanning Regular Languages by Dual Finite Automata'. Together they form a unique fingerprint.

Cite this