automata - What is the typical alphabet size of Finite State Machines? -


It is not perfect that this is the right platform, but in theoretical computer science it was suggested that I moved it here I am ...

What is the typical alphabet of the finite state machines?

I am currently busy implementing a high-performance FA library and need to make some design ideas before proceeding. My state location will be in the order of 2 147 483 647 ( Integer.MAX_VALUE ) which I think is greater than enough, even for non-normal use. Now, whatever remains is the alphabetical space.

Is there any merit in assuming that the alphabet will usually only contain all the displayable characters (in which case it would be really byte which would be really good performance)? Or should the alphabet symbol be translated into string s so that you have alphabet label? In this case, I will need to keep a map that is either a int , short or byte in string It depends on how big I want to make it.

In fact, the alphabet of a finite state machine is any type of mathematical set set There is nothing to restrict, it can be 1 and 0, A-Z, or apple-orange. There is no 'typical' FSM alphabet size. Do you have user's attention for one of your libraries?

Comments