<--- Back to Details
First PageDocument Content
Formal languages / Finite automata / Finite-state transducer / Regular language / Finite-state machine / Regular expression / Deterministic automaton / Alphabet / Induction of regular languages / Star height
Date: 2016-01-06 12:55:41
Formal languages
Finite automata
Finite-state transducer
Regular language
Finite-state machine
Regular expression
Deterministic automaton
Alphabet
Induction of regular languages
Star height

Regular Expressions and Finite-State Automata Overview

Add to Reading List

Source URL: cl.indiana.edu

Download Document from Source Website

File Size: 448,02 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