• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 6,992
Next 10 →

Derivatives of regular expressions

by Janusz A. Brzozowski - JOURNAL OF THE ACM , 1964
"... Abstract. Kleene's regular expressions, which can be used for describing sequential circuits, were defined using three operators (union, concatenation and iterate) on sets of sequences. Word descriptions of problems can be more easily put in the regular expression language if the language is en ..."
Abstract - Cited by 305 (10 self) - Add to MetaCart
Abstract. Kleene's regular expressions, which can be used for describing sequential circuits, were defined using three operators (union, concatenation and iterate) on sets of sequences. Word descriptions of problems can be more easily put in the regular expression language if the language

Regular expression types for XML

by Haruo Hosoya, Jérôme Vouillon, Benjamin C. Pierce
"... We propose regular expression types as a foundation for statically typed XML processing languages. Regular expression types, like most schema languages for XML, introduce regular expression notations such as repetition (*), alternation (|), etc., to describe XML documents. The novelty of our type sy ..."
Abstract - Cited by 204 (21 self) - Add to MetaCart
We propose regular expression types as a foundation for statically typed XML processing languages. Regular expression types, like most schema languages for XML, introduce regular expression notations such as repetition (*), alternation (|), etc., to describe XML documents. The novelty of our type

Regular Expressions

by Sanjiv K. Bhatia
"... Regular expressions provide a powerful tool for textual search in computers. The language of regular expressions forms the basis for many applications and languages in computers, including vi, sed, awk, and perl. In this article, I’ll present the use of regular expressions to perform search and repl ..."
Abstract - Add to MetaCart
Regular expressions provide a powerful tool for textual search in computers. The language of regular expressions forms the basis for many applications and languages in computers, including vi, sed, awk, and perl. In this article, I’ll present the use of regular expressions to perform search

integral of regular expressions

by L. W. Smith, S. S. Yau
"... of regular expressions for automata by the ..."
Abstract - Add to MetaCart
of regular expressions for automata by the

Regular expressions for language engineering

by L. Karttunen, J-p. Chanod, G. Grefenstette, A. Schiller - Natural Language Engineering , 1996
"... Many ofthe processing steps in natural language engineering can be performed using nite state transducers. An optimal way tocreate such transducers is to compile them from regular expressions. This paper is an introduction to the regular expression calculus, extended with certain operators that have ..."
Abstract - Cited by 85 (4 self) - Add to MetaCart
Many ofthe processing steps in natural language engineering can be performed using nite state transducers. An optimal way tocreate such transducers is to compile them from regular expressions. This paper is an introduction to the regular expression calculus, extended with certain operators

Regular Expressions into Finite Automata

by Anne Brüggemann-Klein - Theoretical Computer Science , 1996
"... It is a well-established fact that each regular expression can be transformed into a non-deterministic finite automaton (NFA) with or without ffl-transitions, and all authors seem to provide their own variant of the construction. Of these, Berry and Sethi [BS86] have shown that the construction of ..."
Abstract - Cited by 83 (5 self) - Add to MetaCart
It is a well-established fact that each regular expression can be transformed into a non-deterministic finite automaton (NFA) with or without ffl-transitions, and all authors seem to provide their own variant of the construction. Of these, Berry and Sethi [BS86] have shown that the construction

Regular Expressions

by Bioperl I, Jason Stajich, Perl Intro, Other General Perl Modules, Perl Bioinformatics, Perl Intro Slide, Perl Intro , 2011
"... Useful modules Data formats Databases in BioPerl Sequence objects details ..."
Abstract - Add to MetaCart
Useful modules Data formats Databases in BioPerl Sequence objects details

Regular Expression 1) Regular Expression Basics

by unknown authors
"... Regular expressions are made up of normal characters and metacharacters. Normal characters include upper and lower case letters and digits. The metacharacters have special meanings and are described in detail below. Regular expressions are case sensitive. In the simplest case, a regular expression l ..."
Abstract - Add to MetaCart
Regular expressions are made up of normal characters and metacharacters. Normal characters include upper and lower case letters and digits. The metacharacters have special meanings and are described in detail below. Regular expressions are case sensitive. In the simplest case, a regular expression

Greedy regular expression matching

by Alain Frisch, Luca Cardelli - Proc. of ICALP’04 , 2004
"... This paper studies the problem of matching sequences against regular expressions in order to produce structured values. ..."
Abstract - Cited by 20 (0 self) - Add to MetaCart
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.

Fast Regular Expression Matching using FPGAs

by Reetinder Sidhu, Viktor K. Prasanna , 2001
"... This paper presents an efficient method for finding matches to a given regular expression in given text using FPGAs. To match a regular expression of length n, a serial machine requires O(2 ) memory and takes O(1) time per text character. The proposed approach requires only O(n 2) space and still pr ..."
Abstract - Cited by 191 (16 self) - Add to MetaCart
This paper presents an efficient method for finding matches to a given regular expression in given text using FPGAs. To match a regular expression of length n, a serial machine requires O(2 ) memory and takes O(1) time per text character. The proposed approach requires only O(n 2) space and still
Next 10 →
Results 1 - 10 of 6,992
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University