Finite Automata with Undirected State Graphs
暂无分享,去创建一个
[1] Sheng Yu,et al. State Complexity of Regular Languages , 2001, J. Autom. Lang. Comb..
[2] Martin Kutrib. Reversible and Irreversible Computations of Deterministic Finite-State Devices , 2015, MFCS.
[3] R. Landauer,et al. Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..
[4] Martin Kutrib,et al. Reversible Nondeterministic Finite Automata , 2017, RC.
[5] Martin Kutrib,et al. Minimal Reversible Deterministic Finite Automata , 2015, DLT.
[6] Jarkko Kari,et al. On time-symmetry in cellular automata , 2012, J. Comput. Syst. Sci..
[7] Martin Kutrib,et al. Time-Symmetric Machines , 2013, RC.
[8] Luca Prigioniero,et al. Weakly and Strongly Irreversible Regular Languages , 2017, AFL.
[9] Yuan Gao,et al. A Survey on Operational State Complexity , 2015, J. Autom. Lang. Comb..