• Magma

  • Referenced in 2347 articles [sw00540]
  • help introduce new users to the Magma language. Magma is distributed by the Computational Algebra ... users to report any bugs they find; regular patch fixes are available from the downloads...
  • LANGAGE

  • Referenced in 34 articles [sw00501]
  • Maple package for automaton characterization of regular languages LANGAGE is a set of procedures...
  • RFSA

  • Referenced in 14 articles [sw03315]
  • Learning regular languages using RFSA par Residual languages are important and natural components of regular ... lead experiments which show that when regular languages are randomly drawn using non deterministic representations ... state automata (RFSA). RFSA representations of regular languages may have far less states than...
  • Matchbox

  • Referenced in 24 articles [sw10115]
  • descendants of a regular language, and of the set of non-terminating strings, with respect...
  • HAMPI

  • Referenced in 14 articles [sw09864]
  • fuzzers. Hampi constraints express membership in regular languages and bounded context-free languages. Hampi constraints ... contain context-free-language definitions, regular-language definitions and operations, and the membership predicate. Given...
  • Regular Sets

  • Referenced in 14 articles [sw28793]
  • library of constructions on regular expressions and languages. It provides the operations ... concatenation, Kleene star and derivative on languages. Regular expressions and their meaning are defined...
  • Myhill-Nerode

  • Referenced in 10 articles [sw28547]
  • expressions. There are numerous textbooks on regular languages. Many of them focus on finite automata ... functions, none of which are inductive datatypes. Regular expressions can be defined straightforwardly ... formal language theory -- the Myhill-Nerode Theorem -- can be recreated using only regular expressions. From ... this theorem many closure properties of regular languages follow...
  • RLangGFun

  • Referenced in 6 articles [sw14280]
  • Regular languages and their generating functions: The inverse problem. The technique of determining a generating ... utzenberger methodology. For regular languages, Elena Barcucci et al. proposed an approach for inverting this ... combinatorial interpretation (by means of a regular language) of certain positive integer sequences that...
  • Finite Automata HF

  • Referenced in 5 articles [sw29250]
  • both deterministic and non-deterministic, for regular languages. The Myhill-Nerode Theorem. Closure under intersection ... concatenation, etc. Regular expressions define regular languages. Closure under reversal; the powerset construction mapping NFAs...
  • XDuce

  • Referenced in 53 articles [sw12436]
  • language. XDuce is a statically typed programming language for XML processing. Its basic data values ... documents, and its types (so-called regular expression types) directly correspond to document schemas. XDuce...
  • nSPARQL

  • Referenced in 13 articles [sw11895]
  • motivated several authors to propose RDF query languages with navigational capabilities. In particular, we have ... argued in a previous paper that nested regular expressions are appropriate to navigate RDF data ... proposed the nSPARQL query language for RDF, that uses nested regular expressions as building blocks...
  • Grail

  • Referenced in 17 articles [sw00374]
  • finite-state machines, regular expressions, and other formal language theory objects. Using Grail ... manipulate parameterizable finite-state machines and regular expressions. By `parameterizable’, we mean that the alphabet...
  • VPAlib

  • Referenced in 4 articles [sw24344]
  • many of the desirable properties that regular languages have. VPL is closed under union, intersection...
  • GraphLog

  • Referenced in 29 articles [sw20098]
  • real life recursion. We present a query language called GraphLog, based on a graph representation ... represent edges or paths in the database. Regular expressions are used to qualify these paths ... characterize the expressive power of the language and show that it is equivalent to stratified...
  • AMoRE

  • Referenced in 11 articles [sw20980]
  • automata theory algorithms, including: conversion of regular expression into finite automata, determinization and minimization ... minimization of nondeterministic automata), language operations (e.g. boolean and regular operations, quotients, shuffle product), tests...
  • FIRE station

  • Referenced in 3 articles [sw03711]
  • visualization, exploration and manipulation of regular languages and their various representations, including regular expressions...
  • DReX

  • Referenced in 2 articles [sw16949]
  • DReX: a declarative language for efficiently evaluating regular string transformations. We present DReX, a declarative ... language that can express all regular string-to string transformations, and can still be efficiently ... combinators analogous to the definition of regular languages using regular expressions. While these combinators form...
  • Tree Automata

  • Referenced in 3 articles [sw28835]
  • formalization of the class of tree-regular languages and its closure properties under set operations...
  • LETHAL

  • Referenced in 2 articles [sw09918]
  • supports a great variety of regular tree language operations and property evaluations. More advanced concepts ... finite tree automata is to examine regular languages of trees, which are specially constructed sets...
  • GraphGrep

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