<--- Back to Details
First PageDocument Content
Formal languages / Combinatorics on words / Pattern matching / String matching algorithms / Automata theory / Regular expression / AWK / String / Algorithm / Computing / Software engineering / Software
Date: 2009-07-11 11:28:37
Formal languages
Combinatorics on words
Pattern matching
String matching algorithms
Automata theory
Regular expression
AWK
String
Algorithm
Computing
Software engineering
Software

Microsoft Word - Chapter 1

Add to Reading List

Source URL: www-igm.univ-mlv.fr

Download Document from Source Website

File Size: 2,39 MB

Share Document on Facebook

Similar Documents

Computer programming / Software engineering / Declarative programming / Recursion / Functional programming / Computability theory / Theoretical computer science / Programming paradigms / Algebraic data type / Fold / Pattern matching / Conditional

Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UK

DocID: 1xVgx - View Document

SWiM: Secure Wildcard Pattern Matching From OT Extension Vladimir Kolesnikov1? , Mike Rosulek2 , and Ni Trieu2 1 2

DocID: 1vgge - View Document

Regulatory sequence analysis Matrix-based pattern matching Jacques van Helden Aix-Marseille Université, France

DocID: 1v6Pd - View Document

LPEG: a new approach to pattern matching Roberto Ierusalimschy PEG: Parsing Expression Grammars

DocID: 1utvV - View Document

Analysis of Fundamental Exact and Inexact Pattern Matching Algorithms Jonathan Lee ID#

DocID: 1uq9c - View Document