Resumen
In this paper, we study fuzzy graph rewriting with automaton and regular expression. We use hedge algebra and linguistic variables for modeling and reasoning with words. We figure out theorem of limiting in state space. We also prove that both regular language generated from fuzzy grammar and fuzzy automata are the same.