![Trending Articles on Technical and Non Technical topics](/images/trending_categories.jpeg)
Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Bhanu Priya has Published 1581 Articles
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
15K+ Views
Kleene's Theorem states the equivalence of the following three statements −A language accepted by Finite Automata can also be accepted by a Transition graph.A language accepted by a Transition graph can also be accepted by Regular Expression.A language accepted by Regular Expression can also be accepted by finite Automata.Kleene’s theorem ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
876 Views
The complementation process in the deterministic finite automata (DFA) is explained below −Let’s take a DFA which is defined by (Q, Σ, δ, q0, F) and it accepts the language L1. Now, the DFA that accepts the language L2, where L2 = ̅L1, is defined as follows − ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
1K+ Views
The cross product method process in the deterministic finite automata (DFA) is explained below −Let a's DFA diagram has m number of states and b's DFA diagram has n number of states the cross product m x n will have mxn states.Languages represented by even number of ‘a’ and even ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
3K+ Views
The concatenation process in the deterministic finite automata (DFA) is explained below −If L1 and If L2 are two regular languages, their union L1 ∩ L2 will also be regular.For example, L1 = {an | n > O} and L2 = {bn | n > O}L3 = L1 ∩ L2 ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
2K+ Views
The union process in the deterministic finite automata (DFA) is explained below −If L1 and If L2 are two regular languages, their union L1 U L2 will also be regular.For example, L1 = {an | n > O} and L2 = {bn | n > O}L3 = L1 U L2 ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
2K+ Views
A Deterministic Finite automaton (DFA) is a 5-tuplesM=(Q, Σ, δ, q0, F)Where, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q is the start or initial state.F : Final or accept state.ProblemDesign a finite automaton where ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
3K+ Views
A Deterministic Finite automaton (DFA) is a 5-tuplesM=(Q, Σ, δ, q0, F)Where, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q is the start or initial state.F : Final or accept state.ProblemConstruct a DFA machine accepting ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
9K+ Views
Non-deterministic finite automata (NFA) also have five states which are same as DFA, but with different transition function, as shown follows −δ: Q X Σ → 2QWhere, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
8K+ Views
A Deterministic Finite automaton (DFA) is a five tuplesM=(Q, Σ, δ, q0, F)Where, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q is the start or initial state.F : Final or accept state.ProblemConstruct a DFA machine ... Read More
![Bhanu Priya](https://www.tutorialspoint.com/assets/profiles/314653/profile/60_78287-1615027882.jpg)
Bhanu Priya
2K+ Views
A Deterministic Finite automaton (DFA) is a 5-tuplesM=(Q, Σ, δ, q0, F)Where, Q : Finite set called states.Σ : Finite set called alphabets.δ : Q × Σ → Q is the transition function.q0 ϵ Q is the start or initial state.F : Final or accept state.ProblemConstruct DFA of a string ... Read More