×
Home
Jobs
Tools
Coding Ground
Current Affairs
UPSC Notes
Online Tutors
Whiteboard
Net Meeting
Tutorix
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
Warning
: Use of undefined constant php - assumed 'php' (this will throw an Error in a future version of PHP) in
/var/www/tutorialspoint/mui-header.php
on line
161
Library
Videos
Q/A
eBooks
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
822
Answers
Explain the power of an alphabet in TOC.
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 13:20:12
If Σ is an alphabet, the set of all strings can be expressed as a certain length from that alphabet by using exponential notation. The power of an alphabet is denoted by Σk and is the set of strings of length k.For example, Σ ={0, 1}Σ1= {0, 1} ( 21=2)Σ2= ...
Read More
What are the fundamental concepts of TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 13:14:57
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 ...
Read More
What is a Derivation tree in TOC?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 12:57:41
Derivation tree is a graphical representation for the derivation of the given production rules of the context free grammar (CFG).It is a way to show how the derivation can be done to obtain some string from a given set of production rules. It is also called as the Parse tree.The ...
Read More
Derive the string “00101” using LMD and RMD while using CFG
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 12:56:16
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 ...
Read More
Explain the concept of derivation in TOC
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 12:55:45
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 ...
Read More
What is context free grammar? Explain with examples
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 12:55:12
A context free grammar (CFG) is a forma grammar which is used to generate all the possible patterns of strings in a given formal language.It is defined as four tuples −G=(V, T, P, S)G is a grammar, which consists of a set of production rules. It is used to generate ...
Read More
Convert NFA to DFA and explain the difference between them
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 12:54:32
Some basic difference between a Non-deterministic finite automata (NFA) and Deterministic Finite Automata (DFA) is that in DFA each state has an output for each of the inputs, whereas this is not necessary for NFA.Also, in NFA the input can be \epsilon but in DFA this is not the case.Moreover, ...
Read More
What is the pumping lemma for regular language?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 12:53:09
There are two Pumping Lemmas (PL), which are defined for Regular Languages and Context - Free Languages.Pumping lemma for Regular languagesIt gives a method for pumping (generating) many substrings from a given string.In other words, we say it provides means to break a given long input string into several substrings.Lt ...
Read More
How to show that the regular language is closed under the complementary operation?
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 12:52:42
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 ...
Read More
Find the regular expression for the given Finite automata with state elimination method
Data Structure Algorithms
Computer Science
Computers
Bhanu Priya
Published on 11-Jun-2021 12:52:01
ProblemGenerate RE for a given finite automata by using the state elimination method.SolutionThere are two methods for converting a Deterministic Finite Automata (DFA) to Regular expression (RE).Arden's Theorem Method.State Elimination Method.The given automata is as follows−Step 1Initial state is A that has an incoming edge.So, we have to create a ...
Read More
Previous
1
...
39
40
41
42
43
44
45
...
83
Next
Advertisements
Print
Add Notes
Bookmark this page
Report Error
Suggestions
Save
Close
Dashboard
Logout