Lecture 1 - Finite State Machines (Part 6/9)
Loading...
Loading...
9:58
Lecture 1 - Finite State Machines (Part 7/9)by Coderisland8,214 views- 9:58
Lecture 1 - Finite State Machines (Part 5/9)by Coderisland11,333 views
- 9:58
Lecture 1 - Finite State Machines (Part 8/9)by Coderisland7,183 views
- 5:35
Lecture 1 - Finite State Machines (Part 9/9)by Coderisland7,062 views
- 9:58
Lecture 3 - The Pumping Lemma (Part 4/10)by Coderisland9,558 views
- 9:59
Lecture 5 - Context Free Languages (Part 1/8)by Coderisland15,298 views
- 85 videosFINITE AUTOMATA
- 9:58
Lecture 2 - Closure and Nondeterminism (Part 6/9)by Coderisland4,302 views
- 9:58
Lecture 3 - The Pumping Lemma (Part 1/10)by Coderisland24,474 views
- 9:58
Lecture 3 - The Pumping Lemma (Part 8/10)by Coderisland4,035 views
- 8:00
Deterministic Finite Automata Part 3by TheOresoft3,743 views
- 9:58
Lecture 3 - The Pumping Lemma (Part 9/10)by Coderisland3,825 views
- 9:59
Lecture 7 - Pushdown Machines Automata's (Part 3/9)by Coderisland6,404 views
- 4:51
Computer Science: Converting NFA to DFAby Mcoroklo17,766 views
- 9:59
Lecture 7 - Pushdown Machines Automata's (Part 5/9)by Coderisland4,373 views
- 9:58
Lecture 4 - Minimizing Finite State Machines (Part 4/9)by Coderisland3,565 views
- 9:58
Lecture 1 - Finite State Machines (Part 2/9)by Coderisland21,755 views
- 9:58
Lecture 2 - Closure and Nondeterminism (Part 3/9)by Coderisland5,568 views
- 9:58
Lecture 3 - The Pumping Lemma (Part 2/10)by Coderisland12,313 views
- 9:58
Lecture 2 - Closure and Nondeterminism (Part 7/9)by Coderisland3,852 views
- 9:58
Lecture 4 - Minimizing Finite State Machines (Part 3/9)by Coderisland4,294 views
@luisa9911
As for the binary codes doubling?
Just like in base 10, when we have a string 623, and we add to the end of it a 1, we do 623*10 = 6230, and then we add 1, so we get: 6231.
In binary it works the same way, only now in stead of base-10, we have a base-2. That means that whenever we add a number to the end of a string, we get that same calculation, but with a x*2 in stead of x*10.
So: we have string 11. This codes to 3. We add a 1, and get the string 111. So, we get 3*2 = 6; 6+1 = 7
TimB991 11 months ago
@luisa9911 Appending a 0 to a binary number is the equivalent of multiplying that number by 2. Appending a 1 to a binary string is the equivalent of multiplying that number by 2 and adding 1.
zblangley 1 year ago
Hello! These Lectures are great! I've understood everything till this example.
Can anybody, please, make it clear for me, how does he finds a remainder. I don't get it O_o
10111
1 Step: 1 divides by 3 remainder 1.
2 Step: what's going on here and from this moment? Why does it double remainder if it sees 0? "Because string is doubled" - ??? We began normal 1/3 remainder 1. And now string.
SOS!
luisa9911 1 year ago
This course is really a useful one...and very easy to understand.....
foryouvino 1 year ago
Love this course...
Chethan256 1 year ago