暂无分享,去创建一个
[1] Jan A. Bergstra,et al. Axioms for Behavioural Congruence of Single-Pass Instruction Sequences , 2017, Sci. Ann. Comput. Sci..
[2] Stephen A. Cook,et al. Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..
[3] Jan A. Bergstra,et al. Program algebra for sequential code , 2002, J. Log. Algebraic Methods Program..
[4] Ingo Wegener,et al. Complexity theory - exploring the limits of efficient algorithms , 2005 .
[5] Jan A. Bergstra,et al. On Instruction Sets for Boolean Registers in Program Algebra , 2016, Sci. Ann. Comput. Sci..
[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[7] Jan A. Bergstra,et al. Instruction Sequence Size Complexity of Parity , 2016, Fundam. Informaticae.
[8] Jan A. Bergstra,et al. On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions , 2014, Fundam. Informaticae.
[9] Jan A. Bergstra,et al. Instruction Sequence Based Non-uniform Complexity Classes , 2014, Sci. Ann. Comput. Sci..
[10] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.