A. Gajardo, J. Kari, and A. Moreira, On time-symmetry in cellular automata, J. Comput. System Sci, vol.78, pp.1115-1126, 2012.
DOI : 10.1016/j.jcss.2012.01.006
URL : https://doi.org/10.1016/j.jcss.2012.01.006

Y. Gao, N. Moreira, R. Reis, and S. Yu, A survey on operational state complexity, J. Autom. Lang. Comb, vol.21, pp.251-310, 2016.

M. Holzer, S. Jakobi, and M. Kutrib, Minimal reversible deterministic finite automata, Developments in Language Theory (DLT, 2015.
DOI : 10.1142/s0129054118400063

, LNCS, vol.9168, pp.276-287, 2015.

M. Holzer and M. Kutrib, Reversible nondeterministic finite automata, Reversible Computation (RC 2017), vol.10301, pp.35-51, 2017.

M. Kutrib, Reversible and irreversible computations of deterministic finite-state devices, Mathematical Foundations of Computer Science (MFCS 2015), vol.9234, pp.38-52, 2015.

M. Kutrib and T. Worsch, Time-symmetric machines, Reversible Computation (RC 2013), vol.7948, pp.168-181, 2013.
DOI : 10.1007/978-3-642-38986-3_14

R. Landauer, Irreversibility and heat generation in the computing process, IBM J. Res. Dev, vol.5, pp.183-191, 1961.

G. J. Lavado, G. Pighizzini, and L. Prigioniero, Weakly and strongly irreversible regular languages, Automata and Formal Languages, vol.252, pp.143-156, 2017.
DOI : 10.4204/eptcs.252.15
URL : http://arxiv.org/pdf/1708.06465

S. Yu, Regular languages, Handbook of Formal Languages, vol.1, pp.41-110, 1997.

S. Yu, State complexity of regular languages, J. Autom. Lang. Comb, vol.6, pp.221-234, 2001.