HAHAHAHAHA! My friend asked me for the homework in a class...

MAME

Banned
Sep 19, 2003
9,281
1
0
and I told him:
"Make a DFA that accepts strings with equal 1's and 0's
seems pretty simple, good luck"




Tehehehehehheeeeeeeeeee!
 

fs5

Lifer
Jun 10, 2000
11,774
1
0
Originally posted by: MAME
Originally posted by: HajikuFlip
HAaha, Sh*T you got him good F*CKer!! .....

I know! Hahaha, he'll be working on that one for a while!

I fail to see the humor in your OP, that dfa shouldn't take too long.
 

MAME

Banned
Sep 19, 2003
9,281
1
0
Originally posted by: fivespeed5
Originally posted by: MAME
Originally posted by: HajikuFlip
HAaha, Sh*T you got him good F*CKer!! .....

I know! Hahaha, he'll be working on that one for a while!

I fail to see the humor in your OP, that dfa shouldn't take too long.

bahaha, are you serious? lets see the dfa then
 

fs5

Lifer
Jun 10, 2000
11,774
1
0
Originally posted by: MAME
Originally posted by: fivespeed5
Originally posted by: MAME
Originally posted by: HajikuFlip
HAaha, Sh*T you got him good F*CKer!! .....

I know! Hahaha, he'll be working on that one for a while!

I fail to see the humor in your OP, that dfa shouldn't take too long.

bahaha, are you serious? lets see the dfa then

sorry I was thinking of nfa's, it's been a few years ... in that case

HAaha, Sh*T you got him good F*CKer!! .....
 

MAME

Banned
Sep 19, 2003
9,281
1
0
DFA = Deterministic Finite Automita
NFA = Non-Deterministic Finite Automita

They are made up of states and outputs and represent regular expresions. You just trace through it based on an input string.

Unfortunately for my friend, the problem I stated is not a regular language, bahahah!


Oh, and fivespeed5, you can turn any NFA in to a DFA. Therefore, you can not make an NFA that only accepts strings of equal number of 0's and 1's, sorry!
 

fs5

Lifer
Jun 10, 2000
11,774
1
0
Originally posted by: MAME
DFA = Deterministic Finite Automita
NFA = Non-Deterministic Finite Automita

They are made up of states and outputs and represent regular expresions. You just trace through it based on an input string.

Unfortunately for my friend, the problem I stated is not a regular language, bahahah!


Oh, and fivespeed5, you can turn any NFA in to a DFA. Therefore, you can not make an NFA that only accepts strings of equal number of 0's and 1's, sorry!

oh sh!t you got me good!!!!

... you were beat up a lot as a kid weren't you?
 

MAME

Banned
Sep 19, 2003
9,281
1
0
Originally posted by: fivespeed5
Originally posted by: MAME
DFA = Deterministic Finite Automita
NFA = Non-Deterministic Finite Automita

They are made up of states and outputs and represent regular expresions. You just trace through it based on an input string.

Unfortunately for my friend, the problem I stated is not a regular language, bahahah!


Oh, and fivespeed5, you can turn any NFA in to a DFA. Therefore, you can not make an NFA that only accepts strings of equal number of 0's and 1's, sorry!

oh sh!t you got me good!!!!

... you were beat up a lot as a kid weren't you?

I'm suprisingly normal for a nerd! I wasn't beat up because I can run quickly!
 

MAME

Banned
Sep 19, 2003
9,281
1
0
Originally posted by: mugs
and yet you make jokes about finite state automata...

It wasn't a joke per se. That'd be more like:
"Q: What did the NFA say to the DFA?
A: I'm not sure where to go from here!"

What I said was a prank!
 

MAME

Banned
Sep 19, 2003
9,281
1
0
Originally posted by: TheBoyBlunder
I guess I'm not nerdy enough to understand how this is so darn funny. Oh well.

Would you like me to explain it?
 

TheBoyBlunder

Diamond Member
Apr 25, 2003
5,742
1
0
Originally posted by: MAME
Originally posted by: TheBoyBlunder
I guess I'm not nerdy enough to understand how this is so darn funny. Oh well.

Would you like me to explain it?

Well, as best I understand it, your friend asked you for some help during class. You gave him an impossible answer. You find this funny. I don't. Is that pretty much it?