Filters








107,130 Hits in 5.7 sec

Tree pattern matching from regular tree expressions

Ahlem Belabbaci, Hadda Cherroun, Loek Cleophas, Djelloul Ziadi
2018 Kybernetika (Praha)  
Bottom-up pattern matching by using the Thompson tree automaton of the regular tree expression E.  ...  Top-down pattern matching by constructing a Thompson tree automaton for the regular tree expression E · υ (Σ ∪ {υ}) * ,υ , where E is the regular expression of the tree pattern and υ ∈ Σ 0 represents the  ... 
doi:10.14736/kyb-2018-2-0221 fatcat:ec3rvph23nhqtgnv2q7ugelezm

Selective Regular Expression Matching [chapter]

Natalia Stakhanova, Hanli Ren, Ali A. Ghorbani
2011 Lecture Notes in Computer Science  
Instead of serially matching all regular expressions, we compile a set of shortest patterns most frequently seen in regular expressions that allows to quickly filter out events that do not match any of  ...  This limits the use of regular expressions in majority of modern IDS products. In this work, we present an approach for selective matching of regular expressions.  ...  Ensuring Matching Correctness As a significant number of IDS signatures overlap [26] , it is likely that a set of patterns derived from IDS regular expressions is redundant.  ... 
doi:10.1007/978-3-642-18178-8_20 fatcat:ywazvwihvbbxtjpcrqczcbkyzm

A Memory Efficient Regular Expression Matching by Compressing Deterministic Finite Automata

Utkarsha P.Pisolkar, Shivaji R. Lahane
2015 International Journal of Computer Applications  
General Terms Pattern matching algorithms, Network Security, Theory of Computations. Keywords Regular expressions; security attacks; deterministic finite automata; intrusion detection and prevention.  ...  The performance of the regular expression matching by compressing Deterministic finite automata is evaluated by using regular expression set.  ...  of pattern matching time on uncompressed and compressed DFA generated from regular expressions with pck500 input data file Fig 5: Comparison of pattern matching time on uncompressed and compressed DFA  ... 
doi:10.5120/21815-5143 fatcat:3m5yqovdd5ebjklqctqlebouqa

An Automata-Based Approach to Pattern Matching

Ali Sever
2013 Intelligent Control and Automation  
The Lisp language has its share of operations for evaluating regular expressions, but native parsing of Lisp code in this way is unsupported.  ...  This work presents a new automata-based approach centered on a set of functions and macros for identifying sequences of Lisp S-expressions using finite tree automata.  ...  We present that one must abandon the use of regular expressions, for list pattern matching, in favor of tree parsers.  ... 
doi:10.4236/ica.2013.43036 fatcat:vrwt3etrbnfvbi4pjca7cydgji

Fast Motif Search in Protein Sequence Databases [chapter]

Elena Zheleva, Abdullah N. Arslan
2006 Lecture Notes in Computer Science  
Regular expression pattern matching is widely used in computational biology.  ...  The focus of our work is to develop a method for faster retrieval of PROSITE motif (a restricted regular expression) matches from a protein sequence database.  ...  Background Regular expressions and finite automata are studied in automata and formal language theory, and their understanding is essential to regular expression pattern matching [1, 11] .  ... 
doi:10.1007/11753728_67 fatcat:ot4lthbmfjhk7nzbtxwaq7sfsm

Regular expression pattern matching for XML

Haruo Hosoya, Benjamin Pierce
2001 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '01  
We propose regular expression pattern matching as a core feature for programming languages for manipulating XML (and similar tree-structured data formats).  ...  Regular expression patterns are intended to be used in languages whose type systems are also based on the regular expression types.  ...  Both tree automata and regular path expressions can express extraction of data from an arbitrarily nested tree structure (although, with the single-match style, the usefulness of such deep matching is  ... 
doi:10.1145/360204.360209 dblp:conf/popl/HosoyaP01 fatcat:xirufzbglzce3l5oaw3tnsgjj4

Regular expression pattern matching for XML

HARUO HOSOYA, BENJAMIN C. PIERCE
2003 Journal of functional programming  
We propose regular expression pattern matching as a core feature for programming languages for manipulating XML (and similar tree-structured data formats).  ...  Regular expression patterns are intended to be used in languages whose type systems are also based on the regular expression types.  ...  Both tree automata and regular path expressions can express extraction of data from an arbitrarily nested tree structure (although, with the single-match style, the usefulness of such deep matching is  ... 
doi:10.1017/s0956796802004410 fatcat:7a52iz2mvbgcpnbnpuvl3mlg5y

Regular expression pattern matching for XML

Haruo Hosoya, Benjamin Pierce
2001 SIGPLAN notices  
We propose regular expression pattern matching as a core feature for programming languages for manipulating XML (and similar tree-structured data formats).  ...  Regular expression patterns are intended to be used in languages whose type systems are also based on the regular expression types.  ...  Both tree automata and regular path expressions can express extraction of data from an arbitrarily nested tree structure (although, with the single-match style, the usefulness of such deep matching is  ... 
doi:10.1145/373243.360209 fatcat:nhwid2q62fha3i4lmlpwtamjgu

Hedge Pattern Partial Derivative [chapter]

Taro Suzuki, Satoshi Okui
2009 Lecture Notes in Computer Science  
We propose hedge pattern partial derivatives, an extension of Antimirov's partial derivatives, in order to give an operational semantics of pattern matching of regular hedge expression patterns, which  ...  We show that correct and small matching automata can be constructed from hedge pattern partial derivatives.  ...  We propose hedge pattern partial derivatives of a regular hedge expression pattern, which gives an operational semantics of regular hedge expression pattern matching.  ... 
doi:10.1007/978-3-642-02979-0_16 fatcat:5ixq2iak4ze7fanpc23vs3nrtq

Extending regular expressions with context operators and parse extraction

Steven M. Kearns
1991 Software, Practice & Experience  
Regular expressions are used in many applications to specify patterns because any regular expression can be compiled into a very efficient one-pass pattern matcher called a finite automaton.  ...  KEY WORDS Regular expressions Context sensitive String matching Parse extraction Motivating parse extraction The fastest algorithms for matching a regular expression first compile a regular expression  ...  This work was supported in part by an equipment grant from the Strategic Grants Program of Hewlett-Packard Corporation and NSF grant CDR-84-21402.  ... 
doi:10.1002/spe.4380210803 fatcat:tbht73rkajgltn47zkqddg4vx4

Rule-driven processing of tree-structured data using pointed trees

Nikita Schmidt, Ahmed Patel
2003 Computer Standards & Interfaces  
An implementation of this machine enhanced with regular expression-based query mechanism is discussed.  ...  This machine is shown to be able to express any computable tree transformation.  ...  Tag path patterns for matching are represented as regular expressions. This processor will from now on be referred to as RPE-TPM -a Tree Processing Machine with Regular Path Expressions.  ... 
doi:10.1016/s0920-5489(03)00068-0 fatcat:47e34tgm6fdfjm6itvi3saafnm

Type-Based Optimization for Regular Patterns [chapter]

Michael Y. Levin, Benjamin C. Pierce
2005 Lecture Notes in Computer Science  
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML.  ...  pattern matching expression to generate more efficient target code.  ...  the input type with the patterns of a match expression.  ... 
doi:10.1007/11601524_12 fatcat:zb2xa7stgrdifgp55vb6kxpcge

On the efficient evaluation of relaxed queries in biological databases

Yangjun Chen, Duren Che, Karl Aberer
2002 Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02  
This concept is further integrated with the canonical techniques for pattern searching such as the position tree and automaton theory.  ...  Query relaxation is required due to the fact that queries tend not to be expressed exactly by the users, especially in scientific databas s such as biological databases, in which complex domain knowledge  ...  Below we concentrate only on the (fuzzy) pattern matching and attempt to extend position trees for both the regular expression and the mixed (fuzzy) regular expression searching involving fuzzy equivalence  ... 
doi:10.1145/584792.584832 dblp:conf/cikm/ChenCA02 fatcat:qe3nh2czsfddbpj7etmlhm435u

On the efficient evaluation of relaxed queries in biological databases

Yangjun Chen, Duren Che, Karl Aberer
2002 Proceedings of the eleventh international conference on Information and knowledge management - CIKM '02  
This concept is further integrated with the canonical techniques for pattern searching such as the position tree and automaton theory.  ...  Query relaxation is required due to the fact that queries tend not to be expressed exactly by the users, especially in scientific databas s such as biological databases, in which complex domain knowledge  ...  Below we concentrate only on the (fuzzy) pattern matching and attempt to extend position trees for both the regular expression and the mixed (fuzzy) regular expression searching involving fuzzy equivalence  ... 
doi:10.1145/584830.584832 fatcat:zldrtmrfdng7rdgeiieufoqzqq

A Terse String-Embedded Language for Tree Searching and Replacing

Matúš SULÍR, Slavomír ŠIMOŇÁK
2014 Acta Electrotechnica et Informatica  
Treepace is a new library and a domain specific language for tree pattern matching and replacing, implemented in Python.  ...  Selected concepts resemble the well-known application programing interface (API) for string regular expressions.  ...  Patterns, replacements and rules are passed as arguments to the API methods. However, Treepace modifies the original tree while a regular expression replacement returns a new string.  ... 
doi:10.15546/aeei-2014-0014 fatcat:nlkm76emwbc5thgg5dmhvu2ope
« Previous Showing results 1 — 15 out of 107,130 results