Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
Engineering Mathematics GATE CS

Mathematics Set Operations (Set theory)

Union Union of the sets A and B, denoted by A ∪ B, is the set of distinct element belongs to set A or set B, or both. Above is the Venn Diagram of A U B. Exam...
Engineering Mathematics GATE CS

Mathematics Introduction of Set theory

A Set is an unordered collection of objects, known as elements or members of the set. An element ‘a’ belong to a set A can be written as ‘a &#x22...
Engineering Mathematics GATE CS graph-cycle

Mathematics Graph Theory Basics – Set 1

A graph is a data structure that is defined by two components : A node or a vertex. An edge E or ordered pair is a connection between two nodes u,v that is identifie...
Engineering Mathematics GATE CS

Mathematics Graph Theory Basics – Set 2

Prerequisite – Graph Theory Basics – Set 1 A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense &#x...
Engineering Mathematics GATE CS

Mathematics Matching (graph theory)

Prerequisite – Graph Theory Basics Given an undirected graph, a matching is a set of edges, such that no two edges share the same vertex. In other words, match...
Theory of Computation & Automata

Theory of Computation Chomsky Hierarchy

According to Chomsky hierarchy, grammars are divided of 4 types: Type 0 known as unrestricted grammar. Type 1 known as context sensitive grammar. Type 2 known as cont...
GATE CS Theory of Computation & Automata

TOC Introduction of Theory of Computation

Automata theory (also known as Theory Of Computation) is a theoretical branch of Computer Science and Mathematics, which mainly deals with the logic of computation wi...
Theory of Computation & Automata

Theory of Computation L-graphs and what they represent

Prerequisite – Finite automata introduction All programming languages can be represented as a finite automata. C, Paskal, Haskell, C++, all of them have a spec...
Theory of Computation & Automata

Theory of Computation Finite Automata Introduction

Finite Automata(FA) is the simplest machine to recognize patterns. A Finite Automata consists of the following : Q : Finite set of states. ∑ : set of Input Sy...
GATE CS Theory of Computation & Automata

Theory of Computation Arden’s Theorem

Arden’s theorem state that: “If P and Q are two regular expressions over , and if P does not contain , then the following equation in R given by R = Q ...

Subscribe to Our Newsletter