How do you determine how many different Transition Graphs are over a particular alphabet? For example How many TG's are over the alphabet {x, y}. I am taking a class with a similar question from Daniel I. A. Cohen's book, "Introduction to computer theory." There are plenty of examples of how to create a TG but nothing to determine how many can be created per language. I'm assuming I'm looking for finite amount of TG's? Thank You very much!

$\begingroup$ crossposted on cstheory: mathoverflow.net/questions/71158/transitiongraphperalphabet $\endgroup$ – Kaveh Jul 24 '11 at 23:19

$\begingroup$ I'm not convinced that this is a question of interest to research mathematicians, as per the faq, which see. Voting to close. $\endgroup$ – Gerry Myerson Jul 25 '11 at 5:53
Adding a post because I lack the rep to comment.
There is at least one graph per language (assuming a language is a finite or countably infinite set of finitelength words). There will in fact be infinitely many graphs per language. You need to restrict the question further to have interesting answers. Your first question is about the graphs over a given alphabet whereas the comment later is about graphs per language. There are markedly different.

$\begingroup$ OK sorry my terminology was sloppy. EXAMPLE: How many TG in {x,y}? Or something to that effect. $\endgroup$ – trentonknight Jul 25 '11 at 4:54

2