278 search results - page 9 / 56 » Enumerating Regular Expressions and Their Languages |
EACL
2003
ACL Anthology
13 years 8 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
PODS
2010
ACM
14 years 16 days ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
VLSISP
2008
13 years 7 months ago
2008
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...