<--- Back to Details
First PageDocument Content
Applied mathematics / Nondeterministic finite automaton / Deterministic finite automaton / Powerset construction / Regular expression / Regular language / Automata theory / Theoretical computer science / Computer science
Date: 2004-11-18 06:12:15
Applied mathematics
Nondeterministic finite automaton
Deterministic finite automaton
Powerset construction
Regular expression
Regular language
Automata theory
Theoretical computer science
Computer science

series-parallel-loop construction (3.5, 3.6) ≥ NFA ⊃

Add to Reading List

Source URL: www.jn.inf.ethz.ch

Download Document from Source Website

File Size: 160,13 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