Theory of Computation
1. Tutorial 2. TOC Previous Years Solved 3. TOC PYQs Hindi Videos
Team EasyExamNotes
Regular Expression Examples
Example 1: Let Σ = {a, b}. Write regular expression to define language consisting of strings w such that, w contains only a’s or only b’s … Read more
Mealy Machine
A Mealy machine is a type of finite state automaton (FSA) that produces output on transitions between states. Unlike a Moore machine, which produces output … Read more
Moore machine
A Moore machine is a type of finite state automaton (FSA) that is characterized by its output function. Unlike a Mealy machine, which produces output … Read more
Definition Non Deterministic Finite Automata
Example of NFA, Consider the NFA that accepts all string ending with 01. In this NFA, M = {Q, Σ, δ, q0, F} where, Reference:
DFA solved examples
Example 1: Draw a DFA for the language accepting strings ending with ‘0’ over input alphabets ∑={0, 1} ? Solution: Example 2: Draw a DFA … Read more
How do a DFA Process Strings?
The important thing about DFA is to know that it identifies the acceptance of strings. A DFA processes a string by starting in the start … Read more
Notations for DFA
Transition Diagram: A transition diagram for a DFA M = (Q, Σ, δ, q0, F) is a graph defined as follows: Transition Table:
Definition of Deterministic Finite Automata
A Deterministic Finite Automaton (DFA) consists of a finite set of states and a set of transitions from one state to another state on input … Read more