×
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
628
Answers
Prove that Linear bounded automata LBA ⊂ PSPACE in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:47:21
Linear Bounded Automaton (LBA) is a restricted form of Turing Machine in which input tape is finite.ExampleProve that LBA ⊂ PSPACEPSPACE is a superset of the set of context-sensitive languages.Now to prove LBA=PSPACE, We use theorem of Space compression with tape reduction which states that, For every k-tape S(n) space-bounded ...
Read More
Construct a PDA that accepts (a,b)* language but not contain bbbb?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:44:36
Push down Automata (PDA) is complement of the PDA that contain Substring bbbStepsMake the PDA for accepting those strings that have conation bbb.Complement it by making non-accepting as accepting and vice versa.Construct PDAYou can construct the PDA as shown below for the (a, b)* languageThe nature of transition format is ...
Read More
Distinguish between non-deterministic, deterministic and Turing Machine computational models?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:42:00
Let us begin by understanding the concept of deterministic finite automata (DFA) in the theory of computation (TOC).Deterministic Finite Automaton (DFA)In DFA, for each info image, one can decide the state to which the machine will move. Henceforth, it is called Deterministic Automaton.Formal Definition − A Deterministic Finite automata is ...
Read More
Construct a TM that accepts even-length palindromes over the alphabet {0,1}?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:35:31
A Turing machine (TM) is a 7-tuple (Q, ∑, Γ, δ, q0, qaccept , qreject).Where, Q is a finite set of states.∑ is the input alphabet that does not contain the blank symbol t.Γ is the tape alphabet, where t ∈ Γ and ∑ ⊆ Γ.δ: (Q × Γ) → ...
Read More
Construct a TM for a binary number as an input and replace the last digit with its Boolean complement?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:32:30
ProblemDesign a TM (Turing Machine) that takes a binary number as an input and replaces the last digit of the string with its Boolean complement.SolutionA Turing machine is a 7-tuple (Q, ∑, Γ, δ, q0, qaccept , qreject)Where, Q is a finite set of states.∑ is the input alphabet that ...
Read More
Prove that CFL is closed under union and star but not under intersection?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:29:40
CFL refers to Context Free Language in the theory of computation (TOC). Let us now understand how CFL is closed under Union.CFL is closed under UNIONIf L1 and L2 are CFL’s then L1 U L2 is also CFL.Let L1 and L2 are generated by the Context Free Grammar (CFG).G1=(V1, T1, ...
Read More
Show that the set of all languages that are not recursively enumerable on {a} is not countable?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:26:55
A Recursively enumerable language is the language that accepts every string otherwise not. If a language that halt on every string, then we call it as recursive language.ProblemWe need to prove that the set of all languages that are not recursively enumerable on {a} is not countable.First let see what ...
Read More
Prove that the Cartesian product of a finite number of countable sets is countable?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:24:50
ProblemWe have to prove that the cartesian product of a finite number of countable sets is countable.SolutionLet the X1, X2 ,…….. Xn be the countable sets.Yk= X1 * X2 * …….* Xk when k =1……. N). Thus, Yn := X1 * X2 * · · · * XnProofUsing the induction ...
Read More
What are the P class and NP class in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:23:20
To begin with, let us learn about the P class in the theory of computation (TOC).P-ClassThe class P consists of those problems that are solvable in polynomial time, i.e. these problems can be solved in time O(n k) in the worst-case, where k is constant.These types of problems are called ...
Read More
What are the undecidable problems in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 17:12:28
The problems for which we can’t construct an algorithm that can answer the problem correctly in the infinite time are termed as Undecidable Problems in the theory of computation (TOC).A problem is undecidable if there is no Turing machine that will always halt an infinite amount of time to answer ...
Read More
1
2
3
4
5
6
7
...
63
Next
Advertisements
Print
Add Notes
Bookmark this page
Report Error
Suggestions
Save
Close
Dashboard
Logout