×
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
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
What is the difference between DFA and NFA?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 11:39:26
DFA is the short form for the deterministic finite automata and NFA is for the Non-deterministic finite automata. Now, let us understand in detail about these two finite automata.DFAA Deterministic Finite automata is a five-tuple automata. Following is the definition of DFA −M=(Q, Σ, δ, q0, F)Where, Q : Finite ...
Read More
Construct a pair of languages by using CFG
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 11:37:42
ProblemConsider the following context-free grammars (CFG) and find the pairs of languages which can be generated by Gl and G2 respectively.SolutionConsider the following CFG −G1 : S->aS|B , B->b l bBG2: S->aA | bB , A->aA| B | ε , B->bB | εNow, we can generate the language as follows. ...
Read More
Explain the various applications of automata in TOC
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 11:36:19
Automaton is nothing but a machine which accepts the strings of a language L over an input alphabet Σ.There are four different types of Automata that are mostly used in the theory of computation (TOC). These are as follows −Finite-state machine (FSM).Pushdown automata (PDA).Linear-bounded automata (LBA).Turing machine (TM).When comparing these ...
Read More
Explain the relationship between grammar and language in TOC
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 11:35:27
In order to understand the relationship between the grammar and language in the theory of computation (TOC), let us understand what is language generated by grammar in TOC.Language generated by grammarThe grammar is S-> aSb| E.In this grammar, by using S-> E, we can generate E.Therefore, E is part of ...
Read More
What are the closure properties of Regular languages?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 11:03:33
In an automata theory, there are different closure properties for regular languages. They are as follows −UnionIntersectionconcatenationKleene closureComplementLet see one by one with an exampleUnionIf L1 and If L2 are two regular languages, their union L1 U L2 will also be regular.ExampleL1 = {an | n > O} and L2 ...
Read More
Construct a Finite Automata for the regular expression ((a+b)(a+b))*.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 11:02:25
The language for the given regular expression (RE) is as follows −L={ ε, aa, ab, ba, aaaa, ………}ExampleLet the regular expression be ((a+b)(a+b))*(a+b).Construct the Finite automata for the given regular expression.First, generate the language for the given Regular Expression −L={a, d, aaa, bbb, abb, bab, bba, ………..}This is the language ...
Read More
Convert RE 1(0+1)*0 into equivalent DFA.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 11:00:58
To convert the regular expression to Finite Automata (FA) we can use the Subset method.Subset method is used to obtain FA from the given regular expression (RE).Step 1 − Construct a Transition diagram for a given RE using Non-deterministic finite automata (NFA) with ε moves.Step 2 − Convert NFA with ...
Read More
Construct NFA with Epsilon moves for regular expression a+ba*.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:26:30
The regular expression R= a+ba* divided into r1 and r2r1= a and r2= ba*Let us draw Non-deterministic finite automata (NFA) for r1 as given below −Now, we will go for r2 = ba *Divide r2 into r3 and r4, where, r3=b and r4=a*The NFA for r3 is as follows −The ...
Read More
What is Inductive Hypothesis in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:24:27
Induction is a powerful tool in mathematics. It is a way of proving propositions that hold for all natural numbers.Hypothesis − The formal proof can be using deductive proof and inductive proof. The deductive proof consists of sequence of statements given with logical reasoning in order to prove the first ...
Read More
How to convert Regular expression to Finite Automata?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:21:53
To convert the regular expression (RE) to Finite Automata (FA), we can use the Subset method.Subset method is used to obtain FA from the given RE.Step 1 − Construct a Transition diagram for a given RE by using Non-deterministic finite automata (NFA) with ε moves.Step 2 − Convert NFA with ...
Read More
Previous
1
...
34
35
36
37
38
39
40
...
83
Next
Advertisements
Print
Add Notes
Bookmark this page
Report Error
Suggestions
Save
Close
Dashboard
Logout