Space-efficient multiple string matching automata
by Meng Zhang; Tianyu Yang; Rui Wu
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 5, No. 3, 2012

Abstract: Aho-Corasick (AC) automaton is a data structure for multiple string matching. We present two compressing methods that enable the AC automaton to work on systems with limited resource such as mobile devices. By the first method, the AC automaton for a pattern set P over an alphabet of size σ needs (σ + 1)I + (1 + log|P| + logM)M + o(M) bits where M and I are the number of states and the number of non-leaf states of the AC automaton respectively, and a state transition takes O(1) time. By the second method, the space is I + (1 + log|P| + logM + log σ)M + o(M log σ) bits, and a state transition takes O(log log σ) time. We then combine the two methods together and archive trade-offs between the space and time complexity.

Online publication date: Sun, 11-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com