What is the cardinality of the set of regular grammars?  The caveat is that I'm only interested in grammars which are 'structurally' different.  Sorry I don't know how to talk about this in a formal way, but what I mean is that the actual symbols are arbitrary to me.So for example the grammar with:{N={},={x},P={x},S=}Is equivalent to the grammar:{N={},={y},P={y},S=}Hopefully I am being understood!  I believe this set is countable because for every N and  there are only a finite number of production rules which can be formulated.  For example, for:N={} and ={x}The only unique sets of production rules are:{{x}}{{x}}{{x}, {x}}
What is the cardinality of the set of regular grammars?
regular languages;formal grammars;combinatorics
There is at least one regular grammar per regular language, and all of them are pairwise inequivalent (for any meaningful equivalence relation). Since there is at least a countably infinite number of regular languages, that's a lower bound for the number of regular grammars as well.Without loss of generality, you can write down every regular grammar as finite string over a finite alphabet. Therefore, there are at most as many regular grammars as binary strings, of which there are countably infinitely many.Combine the bounds to get your answer.The lower bounds follows from $\{a\}^n$ being regular for every $n \in \mathbb{N}$.Encode all symbols using binary numbers.