User:HimanshuDigari HD/Books/Theory of Computation(Automata)

Unit 1(Introduction)

 * Introduction
 * Theory of computation
 * Automata theory
 * Computability
 * Computational complexity theory
 * Mathematical notation
 * List of mathematical symbols
 * Sequence
 * Tuple
 * Symbol
 * Letter (alphabet)
 * Alphabet
 * String (computer science)
 * Empty string
 * Kleene star
 * Concatenation
 * Substring
 * String operations
 * Formal language


 * Graph Theory
 * Graph theory
 * Graph (mathematics)
 * Vertex (graph theory)
 * Path (graph theory)
 * Loop (graph theory)
 * Connectivity (graph theory)
 * Glossary of graph theory
 * Null graph
 * Directed graph
 * Signed graph
 * Biased graph
 * Cycle graph
 * Multigraph
 * Mixed graph
 * Planar graph
 * Regular graph
 * Complete graph
 * Bipartite graph
 * Hypergraph
 * Graph operations


 * Set Theory
 * Set theory
 * Set (mathematics)
 * Venn diagram
 * Set-builder notation
 * Algebra of sets
 * Element (mathematics)
 * Cardinality
 * Equality (mathematics)
 * Partition of a set
 * Universe (mathematics)
 * Countable set
 * Uncountable set
 * Empty set
 * Singleton (mathematics)
 * Subset
 * Power set
 * Multiset
 * Union (set theory)
 * Intersection (set theory)
 * Complement (set theory)
 * Symmetric difference
 * Ordered pair
 * Cartesian product


 * Relations and Functions
 * Binary relation
 * Function (mathematics)
 * Domain of a function
 * Codomain
 * Graph of a function
 * Reflexive relation
 * Symmetric relation
 * Asymmetric relation
 * Antisymmetric relation
 * Transitive relation
 * Equivalence relation
 * Reflexive closure
 * Symmetric closure
 * Transitive closure