Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Estimating the Speedup in Parallel Parsing
IEEE Transactions on Software Engineering
An object-oriented specification for compiler
ACM SIGPLAN Notices
Applying classification and inheritance into compiling
ACM SIGPLAN OOPS Messenger
Lexical analysis and parsing techniques for a vector machine
Proceedings of the conference on Programming languages and compilers for parallel and vector machines
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
An object-oriented specification and its generation for compiler
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Efficient instruction scheduling using finite state automata
Proceedings of the 28th annual international symposium on Microarchitecture
| Hi-index | 0.00 |
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.