• XDuce

  • Referenced in 54 articles [sw12436]
  • documents, and its types (so-called regular expression types) directly correspond to document schemas. XDuce ... also provides a flexible form of regular expression pattern matching, integrating conditional branching, tag checking ... describe its foundations in the theory of regular tree automata, and present a complete formal...
  • Grail

  • Referenced in 22 articles [sw00374]
  • computation environment for finite-state machines, regular expressions, and other formal language theory objects. Using ... Grail, one can input machines or expressions, convert them from one form to the other ... manipulate parameterizable finite-state machines and regular expressions. By `parameterizable’, we mean that the alphabet ... finite-state machine or regular expression. Version 2.4 of Grail supports Mealy machines...
  • GraphLog

  • Referenced in 32 articles [sw20098]
  • edges or paths in the database. Regular expressions are used to qualify these paths...
  • Regular Sets

  • Referenced in 15 articles [sw28793]
  • library of constructions on regular expressions and languages. It provides the operations of concatenation, Kleene ... star and derivative on languages. Regular expressions and their meaning are defined. An executable equivalence ... checker for regular expressions is verified; it does not need automata but works directly ... regular expressions. By mapping regular expressions to binary relations, an automatic and complete proof method...
  • nSPARQL

  • Referenced in 13 articles [sw11895]
  • previous paper that nested regular expressions are appropriate to navigate RDF data, and we have ... language for RDF, that uses nested regular expressions as building blocks. In this paper ... expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation ... that the evaluation of a nested regular expression E over an RDF graph...
  • TREX

  • Referenced in 19 articles [sw37675]
  • TREX Tree Regular Expressions for XML. TREX has been merged with RELAX to create RELAX...
  • Myhill-Nerode

  • Referenced in 11 articles [sw28547]
  • Myhill-Nerode theorem based on regular expressions. There are numerous textbooks on regular languages. Many ... none of which are inductive datatypes. Regular expressions can be defined straightforwardly as a datatype ... Theorem -- can be recreated using only regular expressions. From this theorem many closure properties...
  • AMoRE

  • Referenced in 12 articles [sw20980]
  • computing with Automata, Monoids, and Regular Expressions. AMoRE is an implementation of automata theory algorithms ... including: conversion of regular expression into finite automata, determinization and minimization of automata (including ... nondeterministic automata), language operations (e.g. boolean and regular operations, quotients, shuffle product), tests of properties...
  • AWK

  • Referenced in 17 articles [sw23781]
  • arrays indexed by key strings), and regular expressions. While AWK has a limited intended application...
  • JFLAP

  • Referenced in 13 articles [sw10334]
  • minimal state DFA to a regular expression or regular grammar. Click here for more information...
  • Rex

  • Referenced in 8 articles [sw11888]
  • symbolic regular expression explorer. Constraints in form regular expressions over strings are ubiquitous. They occur ... applications. Providing support for regular expression constraints in program analysis and testing has several useful ... symbolically expressing and analyzing regular expression constraints. Rex is implemented using the SMT solver...
  • MSO_Regex_Equivalence

  • Referenced in 7 articles [sw32230]
  • Words Based on Derivatives of Regular Expressions. Monadic second-order logic on finite words ... based on automata but on regular expressions. Decision procedures for regular expression equivalence have been ... straightforward embedding of MSO formulas into regular expressions an extension of regular expressions with ... completeness of an equivalence checker for regular expressions extended in that way. We also define...
  • Regex_Equivalence

  • Referenced in 7 articles [sw32229]
  • Unified Decision Procedures for Regular Expression Equivalence. We formalize a unified framework for verified decision ... procedures for regular expression equivalence. Five recently published formalizations of such decision procedures (three based ... derivatives, two on marked regular expressions) can be obtained as instances of the framework ... approaches based on marked regular expressions, which were previously thought to be the same...
  • Agrep

  • Referenced in 12 articles [sw15546]
  • searched for a string or regular expression, with approximate matching capabilities and user-definable records...
  • PASS

  • Referenced in 8 articles [sw21858]
  • strings, and converts string constraints into quantified expressions that are solved through quantifier elimination ... automaton model to handle regular expressions and reason about string values faster. Our method does ... string comparisons, string-numeric conversions, and regular expressions. Experimental results demonstrate the advantages...
  • GraphGrep

  • Referenced in 11 articles [sw18891]
  • interface to GraphGrep is a regular expression graph query language Glide that combines features from...
  • LFR-toolbox

  • Referenced in 29 articles [sw04756]
  • discrete-time uncertain models, regular and singular parametric expressions, more general uncertainty blocks (nonlinear, time...
  • HAMPI

  • Referenced in 21 articles [sw09864]
  • finders, intelligent fuzzers. Hampi constraints express membership in regular languages and bounded context-free languages...
  • ebs

  • Referenced in 5 articles [sw23318]
  • recognition and parsing of regular expressions. An HTML browser (FireFox or Chrome) is required ... string generated by a regular expression. Both the ”bs” and ”bsp” tools are written ... constructing the recognizer DFA of a regular expression. File ”bsp.html” is the extended Berry-Sethi ... constructing the parser DFA of a regular expression, capable to recognize a string and also...
  • S3

  • Referenced in 9 articles [sw19495]
  • algorithm for a constraint language that is expressive enough for widespread applicability. Specifically, our language ... defined by a regular expression can be encoded as string equations. Secondly, there...