×
Home
Jobs
Tools
Coding Ground
Current Affairs
UPSC Notes
Online Tutors
Whiteboard
Net Meeting
Tutorix
Categories
Java
JSP
iOS
HTML
Android
Python
C Programming
C++ Programming
C#
PHP
CSS
Javascript
jQuery
SAP
SAP HANA
Data Structure
RDBMS
MySQL
Mathematics
8085 Microprocessor
Operating System
Digital Electronics
Analysis of Algorithms
Mobile Development
Front End
Web Development
Selenium
MongoDB
Computer Network
General Topics
Warning
: Use of undefined constant php - assumed 'php' (this will throw an Error in a future version of PHP) in
/var/www/tutorialspoint/mui-header.php
on line
161
Library
Videos
Q/A
eBooks
Library
Videos
eBooks
Trending Categories
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
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
822
Answers
Explain the equivalence between two Finite State Machines.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:00:39
The two finite automata (FA) are said to be equivalent if both the automata accept the same set of strings over an input set Σ.When two FA’s are equivalent then, there is some string x over Σ. On acceptance of that string, if one FA reaches to the final state, ...
Read More
Give an example problem of converting NFA to DFA.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:58:31
ProblemConsider a Non-deterministic finite automata (NFA) and convert that NFA into equivalent Deterministic Finite Automata (DFA).SolutionLet’s construct NFA transition table for the given diagram −States\inputsab->q0{q0, q1}q0q1q2q1q2q3q3q3-q2DFA cannot have multiple states. So, consider {q0, q1} as a single state while constructing DFA.Let’s convert the above table into equivalent DFAStates\inputsab->q1[q0, q1]q0[q0, q1][q0q1q2][q0q1]*[q0q1q2][q0q1q2q3][q0q1q3]*[q0q1q2q3][q0q1q2q3][q0q1q2q3]*[q0q1q3][q0q1q2][q0q1q2]In ...
Read More
Construct the minimum DFA for any given finite automata.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:55:06
ProblemConstruct a minimum state DFA for the following automata −SolutionWe first construct a transition table for the given finite automata −States\inputs01q0q1q5q1q6q2*q2q0q2q3q2q6q4q7q5q5q2q6q6q6q4q7q6q2Q={q0, q1, q2, q3, q4, q5, q6, q7}Q01={q2} and Q02={q0, q1, q2, q3, q4, q5, q6, q7}S0={{q2} {q0, q1, q2, q3, q4, q5, q6, q7}}Consider the set {q0, q1, q2, ...
Read More
Explain the method for constructing Minimum Finite State Automata.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:53:19
A finite state machine (FSM) which has a set of states and two functions called the next-state and output function.The set of states correspond to all the possible combinations of the internal storage.If there are n bits of storage, there are 2n possible states.The next state function is a combinational ...
Read More
How to convert NFA with epsilon to DFA in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:50:59
In this method, we first convert Non-deterministic finite automata (NFA) with ε to NFA without ε.Then, NFA without ε- can be converted to its equivalent Deterministic Finite Automata (DFA).Method for conversionThe method for converting the NFA with ε to DFA is explained below −Step 1 − Consider M={Q, Σ, δ, ...
Read More
How to convert NFA with epsilon to without epsilon?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:46:20
In this method, we try to remove all the ε-transitions from the given Non-deterministic finite automata (NFA) −The method is mentioned below stepwise −Step 1 − Find out all the ε-transitions from each state from Q. That will be called as ε-closure(qi) where, qi ∈Q.Step 2 − Then, 𝛿1 transitions ...
Read More
What is an epsilon closure in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:42:44
The ε closure(P) is a set of states which are reachable from state P on ε-transitions.The epsilon closure is as mentioned below −ε-closure (P) = P, where P ∈ QIf there exists ε-closure (P) = {q} and 𝛿(q, ε) =r then, ε-closure (P) = {q, r}ExampleFind ε-closure for the following ...
Read More
What is an acceptance of language by NFA with Epsilon?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:39:42
The language L accepted by Non-deterministic finite automata (NFA) with ε, denoted by M= (Q, Σ, 𝛿, q0, F) and can be defined as follows −Let M= (Q, Σ, 𝛿, q0, F) be a NFA with εWhere, Q is a set of statesΣ is input setδ is a transition function ...
Read More
How to convert the finite automata into regular expressions?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:33:14
ProblemConvert the given finite automata (FA) into regular expression (RE).SolutionThere are two popular methods for converting a DFA to its regular expression −Arden’s MethodState elimination methodLet’s consider the state elimination method to convert FA to RE.RulesThe rules for state elimination method are as follows −Rule 1The initial state of DFA ...
Read More
Construct the derivation tree for the string aabbabba.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 09:30:16
ProblemDerive a derivation tree for the string aabbabba for the given context free grammar (CFG) −S->aB|bA A->a|aS|bAA B->b|bS|aBBSolutionDerivation is a sequence of production rules, which is used to get input strings.Derivation treeIt is a graphical representation for derivation of given production rules for a given CFG. It is also called ...
Read More
Previous
1
...
36
37
38
39
40
41
42
...
83
Next
Advertisements
Print
Add Notes
Bookmark this page
Report Error
Suggestions
Save
Close
Dashboard
Logout