×
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 relationship between Finite Automata and Regular Expression.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:19:55
In order to understand the relationship between finite automata (FA) and regular expression (RE), we need to understand these terminologies. Let us begin by understanding what is a regular expression.Regular ExpressionRegular expression is the language which is used to describe the language and is accepted by finite automata. Regular expressions ...
Read More
Explain the problems for equivalence of two regular expressions.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:18:23
Problem 1Prove that (1+00*1)+(1+00*1)(0+10*1)*(0+10*)=0*1(0+10*1)*SolutionHere, we need to prove LHS=RHS (Left hand side = Right hand side)Let us solve first LHS(1+00*1)+(1+00*1)(0+10*1)*(0+10*)Take (1+00*1) as a common factor(1+00*1)( ε+(0+10*1)*(0+10*1)Where, (0+10*1)*(0+10*1). It is in the form of R*R where R=0+10*1As we know, (ε+R*R)=( ε+RR*)=R*Therefore, (1+00*1)((0+10*1)*)Taking 1 as common factor(ε+00*)1(0+10*1)*Apply ε+00*=0*0*1(0+10*1)*=RHSHence, the two regular expressions ...
Read More
Explain the meanings of some of the regular expressions.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:16:21
Regular expression is the language which is used to describe the language and is accepted by finite automata. Regular expressions are the most effective way to represent any language. Let Σ be an alphabet which denotes the input set.The regular expression over Σ can be defined as follows −Φ is ...
Read More
Explain Arden’s Theorem in TOC.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:15:04
Arden’s theorem helps in checking the equivalence of two regular expressions.Arden’s TheoremLet, P and Q be two regular expressions over the input set Σ. The regular expression R is given as follows −R=Q+RPThis has a unique solution as R=QP*.ProofLet, P and Q be the two regular expressions over the input ...
Read More
What are the identity rules for regular expression?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:13:40
The two regular expression’s P and Q are equivalent (denoted as P=Q) if and only if P represents the same set of strings as Q does.For showing the equivalence of two regular expressions we need to show some identities of regular expression’sLet P, Q and R be the regular expressions ...
Read More
Construct the Regular expression for the given languages by the user.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:12:27
Regular expression is the language which is used to describe the language and is accepted by finite automata. Regular expressions are the most effective way to represent any language. Let Σ be an alphabet which denotes the input set.The regular expression over Σ can be defined as follows −Φ is ...
Read More
Construct the Regular expression for the given languages.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:11:05
Problem 1Write the regular expression for the language accepting all the strings containing any number of a's and b's.SolutionThe regular expression will be −r.e. = (a + b)*This will give the set as L = {E, a, aa, b, bb, ab, ba, aba, bab, .....}, any combination of a and ...
Read More
Explain the concept of Regular expression.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:09:31
Regular expression is the language which is used to describe the language and is accepted by the finite automata. Regular expressions are the most effective way to represent any language.Regular language is the language which is accepted by some regular expression.Regular sets are sets which are accepted by finite automata.ExampleL={ ...
Read More
Convert the given Moore machine counts into equivalent Mealy machine.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:07:19
Moore machine described by 6 tuples(Q, q0, Σ, O, δ, λ) Where, Q: Finite set of statesq0: Initial state of machineΣ: Finite set of input symbolsO: Output alphabetδ: Transition function where Q × Σ → Qλ: Output function where Q → OGiven Σ ={a, b} and Δ ={0, 1}Sequence= ‘abb’Partial Moore ...
Read More
What is Minimization of DFA?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 12-Jun-2021 10:03:25
ProblemGiven a Deterministic Finite Automata (DFA), try to reduce the DFA by removing unreachable states and removing similar rows.SolutionStep 1Remove the unreachable states from q0From the initial states, we are not able to reach q2 and q4. So, remove these two states as shown below −After removing unreachable states, the ...
Read More
Previous
1
...
35
36
37
38
39
40
41
...
83
Next
Advertisements
Print
Add Notes
Bookmark this page
Report Error
Suggestions
Save
Close
Dashboard
Logout