Index
Abstract
|
Authors
Theory of Computation
Regular Languages
Constructing Finite Automata
Regular Expression to Finite Automata Conversion
Finite Automaton to Regular Expression Conversion
Remove ε-Transitions
NFA to DFA Conversion
Minimal Finite Automaton
Lower Bound for DFA
Closure Property: KLEENE STAR
Closure Property: UNION
Closure Property: CONCATENATION
Context Free Grammars
CYK Parsing Algorithm
parenthesis expressions, e.g. []([])
prefix expressions, e.g. +d+dd
infix expressions, e.g. d-(d-d)
words with an equal number of zeros and ones, e.g.
01101
NPDA Browser
Markov Algorithms
Introduction
Laboratory
Append Prefix
Append Suffix
Erase First
Erase Last
Double String
Reverse String
Palindrome
Odd
Binary Increment
Binary Adder
Multiplication
DIV
GCD
LCM
Unary to Binary
Prefix Decoder/Encoder