Skip to Main content Skip to Navigation
Conference papers

Concise Representations of Reversible Automata

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-01657009
Contributor : Hal Ifip <>
Submitted on : Wednesday, December 6, 2017 - 11:44:18 AM
Last modification on : Wednesday, December 6, 2017 - 1:46:18 PM

File

440206_1_En_19_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Giovanna Lavado, Luca Prigioniero. Concise Representations of Reversible Automata. 19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.238-249, ⟨10.1007/978-3-319-60252-3_19⟩. ⟨hal-01657009⟩

Share

Metrics

Record views

89

Files downloads

74