Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
Articles on Trending Technologies
Technical articles with clear explanations and examples
Matplotlib animation not working in IPython Notebook?
To animate a plot in matplotlib, we can take the following steps −Set the figure size and adjust the padding between and around the subplots.Create a random data of shape 10X10 dimension.Create a figure and a set of subplots, using subplots() method.Makes an animation by repeatedly calling a function *func*, using FuncAnimation() class.To update the contour value in a function, we can define a method animate that can be used in FuncAnimation() class.To display the figure, use show() method.Exampleimport numpy as np import matplotlib.pyplot as plt import matplotlib.animation as animation plt.rcParams["figure.figsize"] = [7.50, 3.50] plt.rcParams["figure.autolayout"] = True data = ...
Read MoreDraw a Turing machine to find 2’s complement of a binary number
2’s complement of binary numbers can be done by using two approaches.Adding 1’s complement+1Traverse bits from left to right, find the 1st 1 bit then reverse all the bits after the 1 bit.ExampleLet the input be 1110010Thus, after performing 2’s complement, the output will be as follows −Output − 0001110Coming to the Turing machine to find 2’s complement, If input is as follows −B010000100The output is as follows −B101111100ExplanationStep 1 − Here, we need to start from the rightmost ends.Step 2 − We will move the R/W head all the way to the right, skipping all the 0s and 1s.Step ...
Read MoreDraw a Turing machine to find 1’s complement of a binary number
1’s complement means transforming the 0 bit to 1 and the 1 bit to 0.Let the input be −B00101110BThe output is as follows −B11010001BConceptThe concept is explained below −Step 1 − Start scanning the input from left to right.Step 2 − If the R/W is at 1, then make it 0 and move right.Step 3 − If the R/W is at 0, then make it 1 and move right.Step 4 − Repeat the steps given above and we will reach B (blank).Step 5 − Then move the R/W head all the way to the left without changing anything until it ...
Read MoreConstruct a TM for the language L= {ww : w ∈ {0,1}}
ProblemThe language L = {ww | w ε {0, 1}} having the string of 0’s and 1’s which is followed by itselfL={00, 11, 1100, 0011, …..}SolutionThe logic for solving the problem is as follows −Find the midpoint of the string.Then match the symbols.ExplanationStep 1 − First, we need to find the midpoint of the string.Step 2 − We will make the first 0 to X or 1 to Y and then move R/W head to the right until the last character is found.Step 3 − Then make this 0 to X or 1 to Y.Step 4 − Now, we will ...
Read MoreConstruct PDA for accepting L = {anb(2n) | n>=1} U {anbn | n>=1}
A push down automata (PDA) can be formally described as seven tuples(Q, Σ, S, δ, q0, I, F)Where, Q is finite number of statesΣ is input alphabetS is stack symbolΔ is the transition function: QX(Σ∪{e})XSXQq0 is the initial state (q0 belongs to Q)I is the initial state top symbolF is a set of accepting statesProblemConstruct PDA for L = {anb(2n) | n>=1} ∪ {anbn | n>=1}SolutionLetL = {anb(2n) | n>=1}{anbn | n>=1}Construct PDA for L= L1 U L2So, the strings which are generated by the given language L1 are as follows−L1={abb, aabbbb, aaabbbbbb, ….} andL2= {ab, aabb, aaabbb, ….}L= L1 ...
Read MoreConstruct a DPDA for anb2n n ≥ 1 in TOC
A deterministic finite automata (DFA) can remember a finite amount of information but A push down automata (PDA) can remember an infinite amount of information.Basically a PDA is as follows −“Finite state machine+ a stack”PDA has three components, which is as follows −An Input tapeA control unitA Stack with infinite sizeA PDA can be formally described as seven tuples (Q, Σ, S, δ, q0, I, F)Q is finite number of statesΣ is input alphabetS is stack symbolΔ is the transition function: QX(Σ∪{e})XSXQq0 is the initial state (q0 belongs to Q)I is the initial state top symbolF is a set of ...
Read MoreConstruct a PDA for language L = {0n 1m2m3n | n>=1, m>=1}
A push down automata (PDA) can be formally described as seven tuples(Q, Σ, S, δ, q0, I, F)Where, Q is finite number of statesΣ is input alphabetS is stack symbolΔ is the transition function: QX(Σ∪{e})XSXQq0 is the initial state (q0 belongs to Q)I is the initial state top symbolF is a set of accepting states(F belongs to Q)ProblemConstruct PDA for 0n1m2m3n where n, m≥1.SolutionSo, the strings which are generated by the given language are −L={0123, 011223, 001233….}The number of 1’s and 3’s are same and number of 2’s and 1’s are sameConstruction of PDA for given problemThe PDA is as ...
Read MoreExplain the basic properties of the Turing machine?
Turing machines are more powerful than both finite automata (FA) and pushdown automata (PDA). They are as powerful as any computer we have ever built.The main improvements from PDAs in Turing machine are explained below −Infinite “all” accessible memory (in the form of a tape) – option to read and write to it.A read/write head can move to the left and to the right on the input tape (or don’t change a position).The TM works on an infinite tape divided into cells (infinite in both directions), each of which contains either a symbol from an alphabet or the blank symbol. ...
Read MoreDistinguish between DPDAs and NPDAs in TOC?
Similar to the finite automata (FA), push-down automata (PDA) can be either deterministic or non-deterministic.A deterministic push down automata (DPDA) never has a choice of the next step −It has the possible output for every combination of state, input character and stack character, as compared to the deterministic finite automata (DFA).We need to be careful about every combination of state and stack character. Only one of the transactions is allowed either for the empty symbol ∧ or for an input symbol. Or there can be no transaction at all.ExampleA non-deterministic push-down automaton (NPDA) can contain the following instructions, but a ...
Read MoreDesign a push down automaton for L = {wwR | w ∈ {a, b}+}?
A pushdown automaton is used to implement a context-free grammar in the same way that we use a technique to design DFA for a regular grammar. A DFA work on a finite amount of information, where as a PDA works on an infinite amount of information.Generally, a pushdown automaton is −"Finite state machine" + "a stack"A pushdown automaton consist of three components −an input tape, a control unit, anda stack with infinite size.Now consider a problem that how to design push down automata for a given language −ProblemDesign a push down automaton which recognizes even length palindromes for L = ...
Read More