论文信息 - The Degree of Irreversibility in Deterministic Finite Automata

The Degree of Irreversibility in Deterministic Finite Automata

Recently, a method to decide the NL-complete problem of whether the language accepted by a given deterministic finite automaton (DFA) can also be accepted by some reversible deterministic finite au...

Martin Kutrib | Markus Holzer | Holger Bock Axelsen

[1] Sheng Yu,et al. The State Complexities of Some Basic Operations on Regular Languages , 1994, Theor. Comput. Sci..

[2] John Watrous,et al. On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[3] Ulrik Pagh Schultz,et al. Towards a Domain-Specific Language for Reversible Assembly Sequences , 2015, RC.

[4] Albert R. Meyer,et al. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[5] Martin Kutrib. Aspects of Reversibility for Classical Automata , 2014, Computing with New Resources.

[6] Martin Kutrib,et al. Minimal Reversible Deterministic Finite Automata , 2018, Int. J. Found. Comput. Sci..

[7] Kenichi Morita,et al. Reversible computing and cellular automata - A survey , 2008, Theor. Comput. Sci..

[8] Martin Kutrib,et al. Boosting Reversible Pushdown Machines by Preprocessing , 2016, RC.

[9] R. Landauer,et al. Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[10] V. Glushkov. THE ABSTRACT THEORY OF AUTOMATA , 1961 .

[11] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .