Abstract
Alternating finite automata (AFA) provide a natural and succinct way to denote regular languages. We introduce a bit-wise representation of reversed AFA ( r-AFA) transition functions and describe an efficient implementation method for r-AFA and their operations using this representation. Experiments have shown that this implementation is much more efficient than, for instance, the Grail DFA implementation in both space and time.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
