Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IS
2011
11 years 6 months ago
Checking determinism of XML Schema content models in optimal time
We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors...
Pekka Kilpeläinen
APWEB
2011
Springer
11 years 6 months ago
Assisting the Design of XML Schema: Diagnosing Nondeterministic Content Models
One difficulty in the design of XML Schema is the restriction that the content models should be deterministic, i. e., the Unique Particle Attribution (UPA) constraint, which means ...
Haiming Chen, Ping Lu
CCR
2010
151views more  CCR 2010»
11 years 9 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...
FSTTCS
2010
Springer
11 years 9 months ago
Average Analysis of Glushkov Automata under a BST-Like Model
We study the average number of transitions in Glushkov automata built from random regular expressions. This statistic highly depends on the probabilistic distribution set on the e...
Cyril Nicaud, Carine Pivoteau, Benoît Razet
MFCS
2010
Springer
11 years 10 months ago
Semi-linear Parikh Images of Regular Expressions via Reduction
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
Bahareh Badban, Mohammad Torabi Dashti
JUCS
2010
130views more  JUCS 2010»
11 years 10 months ago
On the Linear Number of Matching Substrings
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
Yo-Sub Han
ENTCS
2002
121views more  ENTCS 2002»
11 years 11 months ago
Regular Expression Types for Strings in a Text Processing Language
d Abstract) Naoshi Tabuchi Eijiro Sumii Akinori Yonezawa 1 Department of Computer Science, Graduate School of Information Science and Technology, University of Tokyo We present re...
Naoshi Tabuchi, Eijiro Sumii, Akinori Yonezawa
ACTA
2000
302views more  ACTA 2000»
11 years 11 months ago
Efficiently building a parse tree from a regular expression
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...
Danny Dubé, Marc Feeley
IJAC
2007
99views more  IJAC 2007»
11 years 11 months ago
Normalized Expressions and Finite Automata
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...
JFP
2006
90views more  JFP 2006»
11 years 11 months ago
Regular expression filters for XML
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...
Haruo Hosaya
books