In:
ACM SIGPLAN Notices, Association for Computing Machinery (ACM), Vol. 27, No. 4 ( 1992-04), p. 12-16
Abstract:
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.
Type of Medium:
Online Resource
ISSN:
0362-1340
,
1558-1160
DOI:
10.1145/131080.131081
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
1992
detail.hit.zdb_id:
2079194-X
detail.hit.zdb_id:
282422-X
Permalink