Concise Representations of Reversible Automata

In this paper, we present two concise representations of reversible automata. Both representations have a size comparable to the size of the minimum equivalent deterministic automaton and can be exponentially smaller than the size of the explicit representations of corresponding reversible automata. Using these representations it is possible to simulate the computations of reversible automata without explicitly writing down their complete descriptions.