Efficient implementation of regular languages using reversed alternating finite automata

Authors:
K. Salomaa;X. Wu;S. Yu
Affiliations:
Department of Computer Science, Univ. of Western Ontario, London, Ont. Canada;Department of Computer Science, Univ. of Western Ontario, London, Ont. Canada;Department of Computer Science, Univ. of Western Ontario, London, Ont. Canada
Venue:
Theoretical Computer Science - Special issue on implementing automata
Year:
2000

Some succinctness properties of Ω-DTAFA

SEPADS'06 Proceedings of the 5th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Hopcroft's Minimization Technique: Queues or Stacks?

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On the Hopcroft's minimization technique for DFA and DFCA

Theoretical Computer Science
Verification of data paths using unbounded integers: automata strike back

HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing

Hi-index	0.00