# Theory of Computation Notes HCT 424

This is a course description of theory of Computation

This is a course description of theory of Computation

This note talks about the definiton of regular languages and also its use

Describes how models that are not regular are constructed using context free grammars

Theory of computation deals with design computational models which are then used in real life scenarios b

Notes Of Theory of computation for IT, Computer Engg. Students

Main points of this homework are: Least Number of Vertices, N-Vertex Graph, Symmetric Relation, 3-Regular Graph, Cut-Vertex, Simple Graph, Outerplanar Graph, Fixed Limit, Ordinary Network Flow Theory, Maximum Capacity, Feasible Flow

Main points of this homework are: Adjacent Subcube, Center Subcube, Line Graph of Graph, Corresponding Edges, Non-Eulerian Graph, Cartesian Product Graph, Ordered Pair, Two Hamiltonian Graphs, K-Dimensional Hypercube, Vertex for Binary String

Main points of this homework are: Collection of Vertices, Directed Graph, Pairwise Matches, Hypergraph Consists, Collection of Edges, Chromatic Number, K-Uniform Hypergraph, Coloring of Edges, Complete Graph, Number of Monochromatic Copies

Main points of this homework are: K-Edge Connected Graph, 3-Regular Graph, Size of Minimum Vertex Cut, Minimum Edge Cut, Petersen Graph, K-Dimensional Hypercube, Binary String, Pair of Vertices, Finding K Disjoint Paths, Two Vertices

Main points of this homework are: Maximum Degree, Vertices of Degree, Spanning Trees, Complete Graph on Vertices, Directed Graph, Vertex-Capacitated Graph, Koning-Egevary Theorem, Hypergraph Consists, Collection of Edges, Chromatic Number