

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Computer coding on website designing and chapter notes with practice sets and formula and Many more
Typology: Study notes
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Finite State Machine (Prerequisites) IN this lecture we will be studying about some terms like symbol alphabet string language and even some more that would follow. We will study what this means and what they are used for Okay, so let 's start with symbol, so what is a symbol anything like a B is C, 0, 1, 2-3 and so on that is a very simple and the most basic part of it and let us come to. The second one alphabet. An alphabet is denoted by Sigma. A string a collection of symbols is known as same string sequence of symbols strings actually it means a sequence. The concept of language became clear to us. So language are a set of strings over some alphabets. The next thing that we need to discuss is known as powers of Sigma.. Sigma power is denoted by a special symbol called Sigma power zero.. The power of Sigma is a set that is equal to the set of all strings length of length zero.. Epsilon is used to denote the set of all strings of length zero denoted by Sigma power zero. Sigma power 1 is equal to what would that be 0 and 1 or the length of those two length 1 or 0 and. 0.. THe next term that we need to discuss is known as cardinality cardinality. So I hope you already some of you may already know what is when your cardinality. Sigma power n is a set of all strings of length N 1 and the cardinality is 8... Sigma star T star can be replaced with Sigma power T star.. Sigma power 0 is just epsilon Union. Sigma power 1. What is it it is 0-1. Sigma power 2 is 0 0, 0, 1, 1 0 and 1-1, and so on it goes on so let us put the values here.
An example is a language l1 which is a set of all strings that starts with 0 and we need to design a deterministic finite automata or DF a for this language. When 0 is the first digit it goes to B B which is the final state. whenever a string reaches the. final state that means that string is accepted and whenever a. string does not reach the final. state that shows that that is the starting stage of a DFA. Whatever input you get after that whether it is 0 or 1 it stays in the final state B itself and that string will be accepted ok I hope that was clear and now is this complete no this D F is not complete why because we already mentioned what will happen if air gets the input 1 so a is my starting state and if I get input 1 that means 1 is the first digit and should that we accept it or not no it should not be accepted I should accept only those strings which start with 0 so if it starts with 1 1 will happen I 'll send it to another state which I call state C okay I stand it to state C when the input is 1 it goes to state We have successfully design a DFA for all strings that starts with 0. This is accepted so since this string started from the initial state but could not reach the final state this string is not accepted it is rejected so we see that when the string when this string when it started with zero it was accepted but this string as it started from 1 was not accepted. I hope that was clear in the next lecture we will be seeing some more examples. and this examples are the proof for that so I hope. Thank you for watching and see you in the. next one [ Music ] and the rest of the video will be shown at the bottom of the page.