loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Luis Quesada ; Fernando Berzal and Francisco J. Cortijo

Affiliation: University of Granada, Spain

ISBN: 978-989-8565-19-8

Keyword(s): Parallel Finite State Machine, PFSM, Regular Expressions, Automaton, Distributable.

Related Ontology Subjects/Areas/Topics: Domain-Specific Languages ; Modeling Languages ; Models ; Paradigm Trends ; Software Engineering

Abstract: Regular expressions provide a flexible means for matching strings and they are often used in data-intensive applications. They are formally equivalent to either deterministic finite automata (DFAs) or nondeterministic finite automata (NFAs). Both DFAs and NFAs are affected by two problems known as amnesia and acalculia, and DFAs are also affected by a problem known as insomnia. Existing techniques require an automata conversion and compaction step that prevents the use of existing automaton databases and hinders the maintenance of the resulting compact automata. In this paper, we propose Parallel Finite State Machines (PFSMs), which are able to run any DFA- or NFA-like state machines without a previous conversion or compaction step. PFSMs report, online, all the matches found within an input string and they solve the three aforementioned problems. Parallel Finite State Machines require quadratic time and linear memory and they are distributable. Parallel Finite State Machines make ver y fast distributed regular expression matching in data-intensive applications feasible. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.226.36.60

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Quesada L., Berzal F. and J. Cortijo F. (2012). Parallel Finite State Machines for Very Fast Distributable Regular Expression Matching.In Proceedings of the 7th International Conference on Software Paradigm Trends - Volume 1: ICSOFT, ISBN 978-989-8565-19-8, pages 105-110. DOI: 10.5220/0003949901050110

@conference{icsoft12,
author={Luis Quesada and Fernando Berzal and Francisco J. Cortijo},
title={Parallel Finite State Machines for Very Fast Distributable Regular Expression Matching},
booktitle={Proceedings of the 7th International Conference on Software Paradigm Trends - Volume 1: ICSOFT,},
year={2012},
pages={105-110},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003949901050110},
isbn={978-989-8565-19-8},
}

TY - CONF

JO - Proceedings of the 7th International Conference on Software Paradigm Trends - Volume 1: ICSOFT,
TI - Parallel Finite State Machines for Very Fast Distributable Regular Expression Matching
SN - 978-989-8565-19-8
AU - Quesada L.
AU - Berzal F.
AU - J. Cortijo F.
PY - 2012
SP - 105
EP - 110
DO - 10.5220/0003949901050110

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.