The Homomorphism Compression of DFA
Jie Wen · Journal of Guangxi Teachers Education University · 2010
By defining equivalent relationship on status sets,it was proved that a new DFA(Deterministic Finite Automaton) can be constructed which accepts the same language accepted by original DFA in square time.In this paper,we defined a homomorphism relationship,and proved that the new homomorphism compression DFA acceptes the same language accepted by original DFA.