%0 Conference Proceedings
%T Concise Representations of Reversible Automata
%+ Università degli Studi di Milano = University of Milan (UNIMI)
%A Lavado, Giovanna, J.
%A Prigioniero, Luca
%Z Part 2: Contributed Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th International Conference on Descriptional Complexity of Formal Systems (DCFS)
%C Milano, Italy
%Y Giovanni Pighizzini
%Y Cezar Câmpeanu
%I Springer International Publishing
%3 Descriptional Complexity of Formal Systems
%V LNCS-10316
%P 238-249
%8 2017-07-03
%D 2017
%R 10.1007/978-3-319-60252-3_19
%Z Computer Science [cs]Conference papers
%X We present two concise representations of reversible automata. Both representations have a size which is comparable with 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 those representations it is possible to simulate the computations of reversible automata without explicitly writing down their complete descriptions.
%G English
%Z TC 1
%Z WG 1.2
%2 https://inria.hal.science/hal-01657009/document
%2 https://inria.hal.science/hal-01657009/file/440206_1_En_19_Chapter.pdf
%L hal-01657009
%U https://inria.hal.science/hal-01657009
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG
%~ IFIP-DCFS
%~ IFIP-WG1-2
%~ IFIP-LNCS-10316