Regular Expressions and Languages - Theory of Computation
Subject and UNIT: Theory of Computation: Unit II: Regular Expressions and Languages
A language is regular if it can be expressed in terms of regular expression.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
Automata are the kind of machines which take some string as input. This input goes through a finite number of states and may enter in the final state.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
The minimization of FSM means reducing the number of states from given FA. Thus we get the FSM with redundant states after minimizing the FSM.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
We have to convert this NFA with ε to equivalent DFA
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
NFA can be converted to equivalent DFA. Let L be a set accepted by non-deterministic finite automation. Then there exists a deterministic finite automation that accepts L.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
If L is accepted by NFA with ε transitions, then there exist L which is accepted by NFA without ε transitions.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
The ɛ-transitions in NFA are given in order to move from one state to another without having any symbol from input set Σ.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
The concept of Non-deterministic Finite Automata is exactly reverse of Deterministic Finite Automata. The Finite Automata is called NFA when there exists many paths for a specific input from current state to next state.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
The finite automata is called Deterministic Finite Automata if there is only one path for a specific input from current state to next state.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
A finite automata is a collection of 5-tuple (Q, Σ, δ, q0, F)
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
Inductive proofs are special proofs based on some observations. It is used to prove recursively defined objects. This type of proof is also called as proof by mathematical induction.
Automata and Regular Expressions - Theory of Computation
Subject and UNIT: Theory of Computation: Unit I: Automata and Regular Expressions
We will discuss additional forms of proofs with the help of some examples. We will discuss 1. Proofs about sets, 2. Proofs by contradiction,3. Proofs by counter example.