×
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
Explain the balancing parenthesis of PDA
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:14:20
Pushdown Automata (PDA) are the finite automata (FAs), but with the ability to push and pop symbols to/from a stack.PDA accepts strings if there is a legal path from start state to acceptance state for input. Otherwise, the string is rejected.A PDA can be represented by a 7-tuple(Q, ∑, ℾ, ...
Read More
What is Non deterministic finite automata?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:12:28
For each state, there is exactly one transition corresponding to each symbol of the respective alphabet. This is termed as the Deterministic Finite Automaton (DFA)Nondeterministic Finite Automaton (NFA)For each state there can be zero, one, two, or more transitions corresponding to a particular symbol.If NFA gets to a state with ...
Read More
Construct Finite State Machine as Processing input
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:10:47
Finite automata is an abstract computing device. It is a mathematical model of a system with discrete inputs, outputs, states and a set of transitions from state to state that occurs on input symbols from the alphabet Σ.Formal definition of Finite AutomataFinite automata is defined as a 5-tuplesM=(Q, ∑, δ, ...
Read More
What are the Turing machine variations in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:09:22
Turing machines (TM) can also be deterministic or non-deterministic, but this does not make them any more or less powerful.However, if the tape is restricted so that you can only see use of the part of the tape with the input, the TM becomes less powerful (linear bounded automata) and ...
Read More
Design a PDA which recognizes the language
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:08:43
ProblemGenerate the push down automata (PDA) that recognizes the language E={aibj| i is not equal to j and I is not equal to 2j}.SolutionConsider the two languages as given below −L1={aibj|i, j>=0 and i>2j}L2={aibj|i, j>=0 and i<2j}Convince yourself that L=L1UL2In L1, the number of a's are more than double of ...
Read More
Explain removing unit productions in context free grammar
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:07:48
All grammars are not always optimized, which means the grammar may consist of some extra symbols (non-terminals) which increase the length of grammar.So, we have to reduce the grammar by removing the useless symbols.PropertiesThe properties to reduce grammar are explained below −Each non-terminal and terminal of G appears in the ...
Read More
Explain the elimination of epsilon productions in CFG
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:06:28
All grammars are not always optimized, which means the grammar may consist of some extra symbols (non-terminals) which increase the length of grammar.So, we have to reduce the grammar by removing the useless symbols.PropertiesThe properties to reduce grammar are explained below −Each non-terminal and terminal of G appears in the ...
Read More
What are the closure properties for context free language?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:05:34
The closure properties for context free language (CFG) are as follows −Closed under Union Operationn order to show that context-free language is closed under union operation, consider two starting variables S1 and S2 for the two different languages L1 and L2.Grammar for union operation is as shown below −S ->S1|S2If ...
Read More
What is Instantaneous Description and Turnstile Notation?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 16:03:54
The instantaneous description (ID) of a push down automata (PDA) is represented by a triple (q, w, s)Where, q is the state.w is unconsumed input.s is the stack contents.ID is an informal notation of how a PDA compares an input string and makes a decision that string is accepted or ...
Read More
What is a recursive and recursively enumerable language?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 16-Jun-2021 15:59:16
Let us understand the concept of recursive language before learning about the recursively enumerable language in the theory of computation (TOC).Recursive LanguageA language L is recursive (decidable) if L is the set of strings accepted by some Turing Machine (TM) that halts on every input.ExampleWhen a Turing machine reaches a ...
Read More
Previous
1
2
3
4
5
6
7
...
63
Next
Advertisements
Print
Add Notes
Bookmark this page
Report Error
Suggestions
Save
Close
Dashboard
Logout