In this paper, we establish the equivalence between semi- deterministic virtual finite automaton(SDVFA) of order (s,t) and and regular grammar.
