Virtual University

Finite Automaton. (V-U)

Null Production (V-U)

Generalized Transition Graphs (V-U)

PDA corresponding to CFG (V-U)

Introduction to Languages and Computer Theory (V-U)

Polish Notation (o-o-o) (V-U)

Kleene’s Star Closure (V-U)

Pseudo theorem (V-U)

Kleene’s Theorem Part II (V-U)

Pumping Lemma (V-U)

Kleene’s Theorem Part III (V-U)

Pumping Lemma version II (V-U)

Kleene’s Theorem Part IV (V-U)

Regular Expression (V-U)

Kleene’s Theorem Part V (V-U)

Regular Grammar (V-U)

Mealy machine (V-U)

Regular languages and Complement of a language (V-U)

Moore machine (V-U)

Transition Graph (V-U)

Trees (V-U)

Turing machine (V-U)

A definition of Information, Incompressible Strings (V-U)

An Approximation Algorithm for TSP Problem (V-U)

Big Oh and Little Oh Notations, Time Complexity (V-U)