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 by Bhanu Priya
Page 89 of 106
What are the fundamental concepts of TOC?
The basic definitions of the fundamental concepts in the Theory of Computation (TOC) along with the relevant examples are explained below −SymbolSymbols simply call it as a character.It is an atomic unit, such as a digit, character, lowercase letter, etc. Sometimes it is also a word. The formal language does not deal with the “meaning” of the symbols.For example, a, b, c, ……………z0, 1, 2, …………..9+, -, *, %, …………special characters.AlphabetThe set of characters is called as the alphabet.An alphabet is a finite, non-empty set of symbols. It is denoted by Σ or E.For example, Σ ={0, 1} set of ...
Read MoreExplain the concept of derivation in TOC
Derivation is a sequence of production rules. It is used to get input strings. During parsing, we have to take two decisions, which are as followsWe have to decide the non-terminal which is to be replaced.We have to decide the production rule by which the non-terminal will be replaced.Two options to decide which non-terminal has to be replaced with the production rule are as follows −Left most derivationRight most derivation.Let us understand these two options in detail.Left Most DerivationIn the leftmost derivation, the input is scanned and then replaced with the production rule from left side to right. So, we ...
Read MoreDerive the string “00101” using LMD and RMD while using CFG
ProblemDerive the string"00101" for left most derivation (LMD) and right most derivation (RMD) using context free grammar (CFG).SolutionThe grammar is as follows −S->A1B A->0A| ε B->0B| 1B| εLeft Most derivation (LMD)In the left most derivation, the given input is scanned and then replaced with the production rule from left side to right. So, we have to read that input string from left to right.The grammar is as follows −S->A1B rule1 A->0A| ε rule 2 B->0B| 1B| ε rule 3Hence, the LMD will be as follows −S->A1B ->0A1B rule2 ->00A1B rule2 ->001B rule2 ->0010B rule3 ->00101B rule3 ->00101 rule3 Derived the ...
Read MoreHow to show that the regular language is closed under the complementary operation?
Closure property is a technique to understand the class of the resulting language when we are performing an operation on two languages of the same class.That means, suppose L1 and L2 belong to regular language and if regular language is closed under operation ∪, then L1∪L2 will be a Regular language. But if RL is not closed under ∩, that doesn't mean L1∩L2 won't be a RL.For a class to be closed under an operation, it has to hold true for all languages in that class. So, if a class is not closed under an operation, we cannot say anything ...
Read MoreGenerate a Regular Expression for a Finite Automata with state elimination method
ProblemGiven a Finite Automata, we need to convert the Finite Automata into equivalent Regular Expression using the State Elimination Method.Step 1 − Initial state q1 has incoming edge. So, create a new initial state qi.Step 2 − Final state q2 has outgoing edge. So, create a new final state.Step 3 − Start eliminating intermediate states one after another.If there is path going to qi to q2 via q1So after eliminating q1 we can connect a direct path from qi to q2 having costε .c*.a=c*aThere is a loop on q2 using state qiSo after eliminating state q1 we can draw a ...
Read MoreExplain the concept of state elimination method in TOC
There are two methods for converting a Deterministic Finite Automata (DFA) to Regular expression (RE). These methods are as follows −Arden's Theorem Method.State Elimination Method.Now, let us learn about the state elimination method used in TOC.State Elimination MethodStep 1Initial state of DFA does not have any incoming edge.If there exists any incoming edge to the initial state, then we need to create a new initial state which has no incoming edge to it.An example about the relation between incoming edge and initial state is given below−Step 2There must be only one final state in DFA.If there exist multiple final states ...
Read MoreC program to print name inside heart pattern using for loop.
ProblemWrite a program to print heart shaped pattern with the name in centre using for loop.SolutionThe user has to enter the name that should be printed in centre along with the number of rows the stars has to be print.AlgorithmRefer an algorithm given below to print the name in heart pattern by using for loop.Step 1 − Declare variables.Step 2 − Read a name at runtime that should be printed on centre.Step 3 − Read number of rows.Step 4 − Find the length of name.Step 5 − Print upper part of the heart.Step 6 − Print lower part of the ...
Read MoreC program to store the car information using dynamic linked list.
Linked lists use dynamic memory allocation i.e. they grow and shrink accordingly. It is collection of nodes.Node has two parts which are as follows −DataLinkTypes of Linked ListsThe types of linked lists in C programming language are as follows −Single / Singly linked listsDouble / Doubly linked listsCircular single linked listCircular double linked listAlgorithmRefer an algorithm given below for storing the car information by using the dynamic linked list.Step 1 − Declare structure variables.Step 2 − Declare Function definition to display.Step 3 − Allocate dynamic memory allocation to variable.Step 4 − Use do while loop to enter the car information.Step ...
Read MoreC program to perform intersection operation on two arrays
Intersection operationIf array 1 = { 1,2,3,4,6} Array 2 = {1,2,5,6,7}Then, intersection of array1 and array 2 isArray1 ^ array 2 = {1,2,3,4,6} ^ {1,2,5,6,7} = {1,2,6}Set of common elements is called an intersection.The logic for intersection is as follows −k=0; for(i=0;i
Read MoreC program to find the area of circle and cylinder using structures.
In C programming language, we can find the area of circle, area and volume of cylinder with the help of structures.The logic used to find area of circle is as follows −s.areacircle = (float)pi*s.radius*s.radius;The logic used to find area of cylinder is as follows −s.areacylinder = (float)2*pi*s.radius*s.line + 2 * s.areacircle;The logic used to find the volume of cylinder is −s.volumecylinder = s.areacircle*s.line;AlgorithmRefer an algorithm given below to find the area of circle and cylinder along with other parameters by using structures.Step 1 − Declare structure members.Step 2 − Declare and initialize the input variables.Step 3 − Enter length and ...
Read More