Affiliation:
1. Institut für Informatik, Universität Giessen, Arndtstrasse 2, 35392 Giessen, Germany
Abstract
We study reversible deterministic finite automata (REV-DFAs), that are partial deterministic finite automata whose transition function induces an injective mapping on the state set for every letter of the input alphabet. We give a structural characterization of regular languages that can be accepted by REV-DFAs. This characterization is based on the absence of a forbidden pattern in the (minimal) deterministic state graph. Again with a forbidden pattern approach, we also show that the minimality of REV-DFAs among all equivalent REV-DFAs can be decided. Both forbidden pattern characterizations give rise to [Formula: see text]-complete decision algorithms. In fact, our techniques allow us to construct the minimal REV-DFA for a given minimal DFA. These considerations lead to asymptotic upper and lower bounds on the conversion from DFAs to REV-DFAs. Thus, almost all problems that concern uniqueness and the size of minimal REV-DFAs are solved.
Publisher
World Scientific Pub Co Pte Lt
Subject
Computer Science (miscellaneous)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Reversible Two-Party Computations;Electronic Proceedings in Theoretical Computer Science;2023-09-03
2. Closure Properties of Subregular Languages Under Operations;International Journal of Foundations of Computer Science;2023-05-04
3. Reversible Top-Down Syntax Analysis;International Journal of Foundations of Computer Science;2022-11-16
4. Reversible Computations of One-Way Counter Automata;Electronic Proceedings in Theoretical Computer Science;2022-08-27
5. Quotients and atoms of reversible languages;Theoretical Computer Science;2022-06