- Видео 5
- Просмотров 86 777
Mohammad T. Irfan
Добавлен 1 сен 2013
How to Convert NFA to DFA: Dealing with Epsilon Transitions
All DFAs are NFAs, but not all NFAs are DFAs. How can we convert an arbitrary NFA to an equivalent DFA? This video shows how to deal with epsilon transitions during this conversion.
Просмотров: 41 624
Видео
Programming with NetworkX in Python
Просмотров 21 тыс.4 года назад
CAUTION: Do NOT name your Python file networkx.py. It will trick Python into thinking that your file is the NetworkX library. Code: www.mtirfan.com/files/graphs.py Main topics: 1. Creating a graph, adding nodes and edges, adding attributes to nodes and edges, and doing common graph operations. 2. Visualizing a graph. 3. Generating Erdos-Renyi random graphs and Barabasi-Albert preferential attac...
PuLP Tutorial: Linear Programming in Python
Просмотров 15 тыс.4 года назад
Source Code: www.mtirfan.com/files/bakery.py
NetLogo Comparison: Erdos-Renyi, Watts-Strogatz, and Barabasi-Albert Network Models
Просмотров 1,8 тыс.4 года назад
A very high-level comparison of three network models based on an application scenario of the propagation of viruses, information, misinformation, etc. in networks. These three models are Erdos-Renyi random graphs, Watts-Strogatz small worlds, Barabasi-Albert preferential attachment. The goal is NOT to investigate propagation (which has been well studied in network science) but to think critical...
VCG & GSP Auctions in Sponsored Search Markets
Просмотров 7 тыс.8 лет назад
Social and Economic Networks Course by Prof. Mohammad T. Irfan Bowdoin College
Finally, I understand NFA to DFA before Midterms, thanks 🎉
best explanation on this topic on youtube, thank you!
Davis Kimberly Lee Amy Williams Nancy
Johnson Brenda Davis Ruth Lopez Helen
Martinez Gary Johnson Sarah Rodriguez Michelle
3 years later and still a great video.
you are amazing
youre my king thanks to you i can sleepp just for these video in gonna subscribe you
What happens when f epsilon to another state
should {g,f} not be {g,f,s} because u can go from a to s through epsilon.
great !
Appreciate your clear explanation. Please continue making Computer Theory videos, such as converting regular expression to NFA and vice versa. Also, didn't mean to point this out, but because we are building DFA at the end, shouldn't our DFA have trap states? Anyway, thank you for your video, sir.
Great video brother , please keep it up
thankss
best explaination
Fantastic presentation, thanks.
this man is good af thanks life savor
Jazak Allah khayran brother. Excellent lecture 👌
cleanest and the clearest explanation even covers starting with an epsilon transition
Thank you!
very clear explanation - thank you. One question, in your example with two possible Nash Equilibriums for GSP, which of them maximizes social welfare ?
Great tutorial. Not too complicated, not too simple. Minor comment: I found that passing the PULP_CBC_CMD(msg=0) argument to lp.solve raised an error: pulp.apis.core.PulpSolverError: PULP_CBC_CMD: Not Available (check permissions on ...
Big shout out to you bro!
You are amazing!
Very good intro to graphs in Python. Clear and easy to follow.
shouldn't DFA cover all of the transitions(0 and 1)? g and g,f doesn't have any transitions
This is because in the NFA, there is no transition out of g or out of f. In general, we cannot have a transition in the DFA that does not exist in the NFA.
@@irfan_ But we can add a new state, which both {g,f} and {g} goto, with both inputs (0,1), and that new state also goes to itself for both inputs (0,1). Instead of putting dashes, if you create a new state for null states it would have been clear ig.
Excellent presentation.
Good job!
Great video thanks a lot
Thanks for the very helpful explanation!
Very interesting , Thanks.
thank you so much
Thank you for this incredibly useful video.
Awesome! please, what is the app you use?
Goodnotes
Please more video on computation theory, and all amaizing stuff . All the best !
Is there a way to display a NetworkX graph in 3D? I’d like to model forces along the edges of the graph, like springs
The video is really informative and helpful. However, I have a query, if I read an unlabled dataset(downloaded from the internet) via networkx and want to lable the nodes. How can I do that?
Wow. Thank You
How do remove path between nodes please not remove the edges.
Hi sir, this is Nadjib from Algeria I've seen your video on YT explains the conversion of e-NFA to DFA I've programmed an APP that do this thing The app is amizing, the user design the NFA by mouse and the result DFA is an .png image.. and it's totaly free Can you publish it for me please? I mean you put a link in the video description or put it in the first comment
Great work man. Please keep uploading material of graphs of this kind. How do i work with a file?
can you refer a book?
This is based on Michael Scott's Programming Languages book.
Thank you so much for this excellent tutorial
I will like to know the solver in pulp that can solve a Linear programming problem using simplex method.
how to add a condition so that only products of the same type and type can be in one warehouse, so that the model calculates which one is cheaper We do not know the type of product, but we need to add a condition so that nothing or one type of product can come to the warehouse one warehouse
Love this video - very comprehensive yet understandable!!
Thank you! Would you please let me know how I could draw more than two edges between two nodes in the same direction?
Good Introduction to networkx.
Good Video to learn
Bahuth sahi. Thanks much for that.