Ryan

I wear shorts with flip-flops all of the time, but I am wondering if I do a good job of pulling off the jeans and flip-flops look. Please let me know what you think!

Picture of me in a T-shirt, jeans, and flip-flops:

http://imagizer.imageshack.us/v2/1600x1200q90/577/...

Do you think jeans with flip-flops is a good clothing combination for guys?

Girls: Do I look better in shorts/flip-flops or jeans/flip-flops?

Picture of me in shorts/flip-flops:

http://imagizer.imageshack.us/v2/1600x1200q90/593/...

Picture of me in jeans/flip-flops:

http://imagizer.imageshack.us/v2/1600x1200q90/577/...

We are asked to do the following:

Consider the following dfa. We would like to know for n∈N, how many

strings of length n are accepted by this dfa. There are two ways to solve this

problem. (a) One is using a recursive function which computes the number

of strings of length j that start at the initial state and end at state q. (b) The

other is to use a recursive function which computes the number of strings of

length j that start at state q and end at one of the final states. Implement

these two methods as functions in a driver program, and turn in the printout

of your program and proper sample runs. You have to have two functions

with one local function in each.

Note: the language for the DFA only consists of a’s and b’s.

A picture of this DFA can be found here: http://img403.imageshack.us/img403/1867/dfaxj5.png

The basic idea is that we are supposed to take the given DFA (which itself has only one accepting state) and essentially “separate” it into two (corresponding to the two recursive functions we are supposed to have, each of which has a local function): one function in which the DFA starts at the original starting state (i.e, qo) and at ends at some q state that is not the original accepting state, and one function which starts at the state q that we selected for the first part and ends at the original accepting state. In the case of this particular DFA, we have four states: q0 (the original starting state), q1, q2, and q3 (the original accepting state). So for instance, we could decide to make q2 the accepting state for the first function (and this first function would thus calculate the number of strings, for any length n that is entered by the user, that are accepted by starting at q0 and ending at q2); and then because we choose these parameters for the first part, the second function would calculate the number of strings, for any length n, that is entered by the user, that are accepted by starting at q2 and ending at q3.

One way I though of to approach the problem was to somehow generate all of the possible a and b combinations for a given length entered by the user, store this date somewhere (i.e. an array, vector, etc) and then pass each of the individual strings character-by-character one at a time (i.e. so if the string was “aaa”, each character would be evaluated individually) to a recursive function that would determine if that string is accepted by the DFA, based on the characteristics of the DFA. However, this seems to not be the most ideal way to solve the problem, since it would involve passing in all of the possible a and b combinations one-by-one to a recursive function from main. Is there some way that the recursive calls themselves can cover all of the possible combinations (such that actual a and b combinations would NOT be passed into the function from main, since the two recursive functions themselves would be responsible for covering all possible combinations for any length, for each of the of the two parts of the problem)? I’ve been thinking about this and I have a “feeling” that this could somehow be done, but I am not entirely sure as to how to go about solving the problem in this manner (i.e. deciding how many different recursive calls would be needed to cover all possibilities, how to order the recursive calls correctly, what, if any, conditions should be true for a given recursive call to be invoked, etc); I know that one parameter that would have to be used as a means of control and to eventually stop the recursive calls is the length (i.e. a length-1 parameter in the recursive calls), since that is decided by the user, but I having difficulty coming up with other parameters to use in the recursive calls. I am also not sure what purpose(s) the two local functions (each of which would be inside one of the two recursive functions) should serve. Any help and advice on how to develop and implement this type of recursive algorithm to solve this problem would be greatly appreciated.

To start off with, I have a ZyXEL ZyAIR G-2000 router and I have the following ZyNOS firmware version: V3.60(HI.1)

Whenever I am connected to the internet via my router and set up a dedicated server on my PC for Team Fortress II (using the Team Fortress II Dedicated Server program that is provided by Steam), my server does not show up on the Internet Servers list, and people are also not able to connect to my server by either manually adding my server’s IP to their favorites list or by joining through Steam; whenever my friend would try to connect, he would get a “Server does not respond” message. Note that I am able to join other servers just fine when I am connected to the internet via my router; it is only that nobody can join my server. On the other hand, when my PC is directly connected to my modem and my router is not involved at all, there are no problems: my server shows up on the Internet Servers list, and my friend (the same one who cannot connect when my router is involved) is able to connect to my server.

I can’t see any reason why my server shouldn’t show up on the Internet Servers list and why people can’t to my server when my router is involved, as the firewalls on both my PC and my router are off, services blocking on my router is disabled, and all ports (both for Steam Client and Steam Server) that are needed for this game (which I obtained from portforward.com and then cross-referenced with the information on Steam’s website, so I know that I am not missing any ports) are forwarded to my machine on our LAN; I setup a local static IP address on this machine so that my local IP address is always the same for port-forwarding purposes. Additionally, the default server is set to 0.0.0.0 on my router’s SUA/NAT page, and all of the local IP addresses on our LAN are mapped to one single global IP address (the global IP address is not static) from our internet provider (many-to-one address mapping scheme).

What makes this issue even more interesting is that I am able to host a dedicated server for at least one game (it’s possible that I may be able to host servers for other games as well, but I haven’t ever tried to host a server for any of the other games that I play as I have no need to do so) on my PC when I am connected to the internet via my router: I have been hosting a dedicated server on my PC for the game Star Wars: Battlefront II for over three years with no issues of users not being able to connect to my server. I have also never needed to forward any ports for this game.

I don’t know if this may have any relation to this particular problem, but I also see these access blocked notices in my router’s logs quite frequently:

Packet without a NAT table entry blocked: ICMP(type:3, code:3)

Packet without a NAT table entry blocked: ICMP(type:3, code:11)

Any help to resolve this issue would be greatly appreciated.