linking automatonの例文

例文

1. Another version is the Kolmogorov-Uspensii machine, and the Knuth " linking automaton " proposal . ( For references see pointer machine ).
2. At least three major varieties exist in the literature the Kolmogorov-Uspenskii model ( KUM, KU-machine ), the Knuth linking automaton, and the Sch鰊hage Storage Modification Machine model ( SMM ).
3. Depending on the type, a pointer machine may be called a linking automaton, a KU-machine, an SMM, an atomistic LISP machine, a tree-pointer machine, etc . ( cf Ben-Amram 1995 ).