×
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
What is Push down automata in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:59:13
A push down automata (PDA) is a way to implement a context free grammar (CFG) in a similar way to design the deterministic finite automata (DFA) for a regular grammar.A DFA can remember a finite amount of information but a PDA can remember an infinite amount of information.Basically, a PDA ...
Read More
Explain if the CFG is recognized by Non-deterministic push down automata
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:57:41
Context Free Grammars (CFG) are definitely recognized by Non-deterministic push down automata (NPDA), but Programming languages are translated to binary (Machine Code) via Deterministic PDA.This is because it has the following below mentioned impacts −If Programming languages were supposed to be translated via NPDA then for one given program instance ...
Read More
Design an unambiguous CFG in CNF that generates E?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:57:06
ProblemDefine the language, E={aibj|i not equal to j and i not equal to 2j} and design an unambiguous context free grammar (CFG) in Chomsky normal form (CNF) that generates E.SolutionThe unambiguous CFG for the given language is as follows −S->AC|CBA->aA|aB->Bb|bC->aCb|aaCb|epsilonNow, convert this CFG into CNF. You can follow the below ...
Read More
Explain Multi tape Turing Machine in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:55:36
A Turing machine (TM) with several tapes is called a multi tape Turing machine.Every tape’s have their own Read/Write headFor N-tape Turing MachineM={( Q, X, ∑, δ, q0, B, F)}We define Multi-tape Turing machine as k-tapes with k-tape heads moving independently (generalisation of multi-track Turing machines).δ=QxXN ->Q x XN x ...
Read More
Explain Turing Machine variant Two Stack PDA?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:50:16
Two stacks push down automata (PDA) includes the following factors −A Turing machine can accept languages that are not accepted by any PDA with one stack.The strength of pushdown automata is increased by adding extra stacks.A PDA with two stacks has the same computation power as for a Turing Machine.Two-Stack ...
Read More
Explain about a non-deterministic Turing Machine?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:48:13
Non-determinism like in PDA (partially NFA) for one input configuration has several possible outputs.The non-deterministic TM is like TM but with a finite number of choices of moves; may have more than 1 move with the same input “current state & current symbol”.The non-deterministic TM accepts the input w if ...
Read More
Construct a TM for adding 1 to a binary natural number?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:42:45
A Turing machine (TM) can be formally described as seven tuples −(Q, X, ∑, δ, q0, B, F)Where, Q is a finite set of states.X is the tape alphabet.∑ is the input alphabet.δ is a transition function: δ:QxX->QxXx{left shift, right shift}.q0 is the initial state.B is the blank symbol.F is ...
Read More
Construct a Turing machine for adding 2 to the binary natural number?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:40:04
A Turing machine (TM) can be formally described as seven tuples −(Q, X, ∑, δ, q0, B, F)Where, Q is a finite set of states.X is the tape alphabet.∑ is the input alphabet.δ is a transition function:δ:QxX->QxXx{left shift, right shift}.q0 is the initial state.B is the blank symbol.F is the ...
Read More
How to use Turing machines to recognize languages in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:32:33
A Turing machine (TM) can be formally described as seven tuples −(Q, X, ∑, δ, q0, B, F)Where, Q is a finite set of states.X is the tape alphabet.∑ is the input alphabet.δ is a transition function: 𝛿:QxX->QxXx{left shift, right shift}.q0 is the initial state.B is the blank symbol.F is ...
Read More
Construct Turing machine for subtraction
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 15-Jun-2021 19:07:43
A Turing machine is a seven tuples(Q, Σ, Γ, δ, q0, qacc, qrej)Where, Q is finite number of statesΣ is the input alphabet does not contain the blank symbol t;Γ is the tape alphabet, where t ε Γ and Σ ⊆ Γ;δ: (Q × Γ) → (Q × Γ × ...
Read More
Previous
1
2
3
4
5
6
7
8
...
63
Next
Advertisements
Print
Add Notes
Bookmark this page
Report Error
Suggestions
Save
Close
Dashboard
Logout