<--- Back to Details
First PageDocument Content
Number / Recursive transition network / Truthiness / Formal grammar / 0.999... / Regular expression / Backus–Naur Form / Formal languages / Mathematics / Combinatorics
Date: 2011-08-24 08:03:05
Number
Recursive transition network
Truthiness
Formal grammar
0.999...
Regular expression
Backus–Naur Form
Formal languages
Mathematics
Combinatorics

Introduction to Computing: Explorations in Language, Logic, and Machines

Add to Reading List

Source URL: www.computingbook.org

Download Document from Source Website

File Size: 601,90 KB

Share Document on Facebook

Similar Documents

Perl regular expression puzzle: even zeros and odd ones Greg Bacon The challenge was to write a regular expression — subject to seemingly tight constraints: only literals, concatenation, Kleene star,

DocID: 1vc3D - View Document

Regular Expression Matching on Graphics Hardware for Intrusion Detection Giorgos Vasiliadis, Michalis Polychronakis, Spiros Antonatos, Sotiris Ioannidis, Evangelos P. Markatos FORTH-ICS, Greece

DocID: 1v8HL - View Document

Derivative-Based Diagnosis of Regular Expression Ambiguity Martin Sulzmann1 and Kenny Zhuo Ming Lu2 1 Karlsruhe University of Applied Sciences

DocID: 1tI80 - View Document

Fixing Regular Expression Matching Failure Martin Sulzmann1 and Kenny Zhuo Ming Lu2 1 Karlsruhe University of Applied Sciences

DocID: 1tFZR - View Document