×
Home
Jobs
Tools
Coding Ground
Current Affairs
UPSC Notes
Online Tutors
Whiteboard
Net Meeting
Tutorix
Login
Packages
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
Login
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
579
Answers
Design a DFA accepting stringw so that the second symbol is zero and fourth is 1
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 16:14:42
ProblemConstruct DFA which accepts a string that contains second symbol is zero and fourth symbol is 1 over an alphabet ∑={0, 1}.SolutionInput − 00110Output is accepted; because in the given string the second symbol is ‘0’ and the fourth symbol is ‘1’.Input − 11001Output − string is not accepted, because the second symbol is ...
Read More
Explain the intersection process of two DFA’s
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 16:11:25
According to the theorem, If L and M are two regular languages, then L ∩ M is also regular language.ExampleConstruct A∩B where A and B is given as follows −The language A ={10, 100, 00, 001, 1010, …..}The language B ={01, 1010, 10, 101, …..}AA = (QA, Σ, δA, qa, ...
Read More
Design a DFA accepting a language L having number of zeros in multiples of 3
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 16:09:04
ProblemConstruct a deterministic finite automata (DFA) that accepts a language L which has the number of zero’s is of multiple of 3 over an alphabet ∑=”{0, 1}.SolutionIf input is: 000 Output is: string is acceptedBecause here the number of zero’s is multiple of 3.Designing DFAIn order to construct the DFA, ...
Read More
Explain about regular expressions in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 16:06:33
A regular expression is basically a shorthand way of showing how a regular language is built from the base set of regular languages.The symbols are identical which are used to construct the languages, and any given expression that has a language closely associated with it.For each regular expression E, there ...
Read More
Construct DFA beginning with ‘a’ but does not have substring ‘aab’
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 16:06:19
ProblemGiven language to construct the deterministic finite automata (DFA) is, the strings start with ‘a’ but not contain substring ‘aab’ over alphabet ∑={a, b}.SolutionIf the input is: “baabba”The output is: string is not acceptedBecause the string does not start with ‘a’, and generating a substring ‘abb’, DFA transition diagramThe DFA ...
Read More
Prove that the polynomial time reduction is from the Clique problem to the Vertex Cover problem
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 15:57:06
Vertex cover is a subset of vertices that covers all the edges in a graph. It is used to determine whether a given graph has a 3SAT to vertex cover.Clique is called a subset of vertices that are all directly connected. It determines whether a clique of size k exists ...
Read More
Construct a DFA recognizing the language {x | the number of 1's is divisible by 2, and 0'sby 3} over an alphabet ∑={0,1}
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 15:49:41
ProblemThe given language L={ x | the number of 1's is divisible by 2, and 0's by 3} over an alphabet ∑={0, 1}.SolutionThe language is divided into two parts, first we need to find the number of 1’s divisible by 2 and second find out the number of 0’s divisible ...
Read More
What is a Queue Automaton?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 15:45:54
A queue automaton is like a push-down automaton (PDA) except that the stack is replaced by a queue.A queue is a tape allowing symbols to be written only on the left-hand end and read only at the right-hand end.Each write operation (we’ll call it a push) adds a symbol to ...
Read More
Differentiate between Ambiguous and Unambiguous Grammar
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 15:44:20
Before understanding the differences between ambiguous grammar and unambiguous grammar, let us learn about these concepts.Ambiguous GrammarA grammar is said to be ambiguous if there exists more than one left most derivation or more than one right most derivation or more than one parse tree for a given input string.If ...
Read More
Construct DFA of alternate 0’s and 1’s
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 15:42:36
ProblemConstruct deterministic Finite automata (DFA) whose language consists of strings with alternate 0’s and 1’s over an alphabet ∑ ={0, 1}.SolutionIf Σ = {0, 1} (ε + 1)(01)* (ε + 0) is the set of strings that alternate 0’s and 1’s Another expression for the same language is (01)*+ 1(01)*+ ...
Read More
Previous
1
2
3
4
5
6
7
...
58
Next
Advertisements
Print
Add Notes
Bookmark this page
Report Error
Suggestions
Save
Close
Dashboard
Logout