搜索结果: 1-2 共查到“模糊数学 Cellular Automata”相关记录2条 . 查询时间(0.067 秒)
Together with the concept of reversibility, another relevant physical notion is time-symmetry, which expresses that there is no way of distinguishing between backward and forward time directions. This...
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comonads.