Finite State Automatons and Regular Expressions

[Previous Chapter] [Previous Page] [Contents] [Next Page] [Next Chapter]
*Finite State Automatons and Regular Expressions
*Example: DFA for Floating Point Numbers
*Finite State Automatons as Graphs
*Regular Grammars as Graphs
*Converting Regular Grammars to DFAs
*Non-deterministic Finite Automaton
*Converting NFAs to DFAs
*Regular Expressions
*A Grammar for Regular Expressions
*egrep Utility
*sed Utility
*Less Regular Expressions
[Previous Chapter] [Previous Page] [Contents] [Next Page] [Next Chapter]
Copyright © 2002 Andreas Borchert, converted to HTML on May 02, 2002