<--- 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

National School SIDRA 2017: Formal Methods for the Control of Large-scale Networked Nonlinear Systems with Logic Specifications Lecture L4: Regular languages?

DocID: 1v5XV - View Document

CSCI 3130: Formal Languages and Automata Theory The Chinese University of Hong Kong, Fall 2010 Lecture 15 Andrej Bogdanov

DocID: 1uDy7 - View Document

Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtrackingāˆ— Roman R. Redziejowski Abstract Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG)

DocID: 1tWkC - View Document

Formal Verification of Code Generators for Modeling Languages (Invited Talk) Xavier Leroy Inria, Paris, France

DocID: 1tNbI - View Document

A Case for Combining Industrial Pragmatics with Formal Methods Eric L. McCorkle I. BACKGROUND A. Dependent Types Dependently-typed languages [9] possess a type system with

DocID: 1tbAh - View Document