本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：1998
摘要
In dynamical systems such as 細胞自動機 and iterated maps, it is often useful to look at a 語言 or set of symbol sequences produced by the system. There are well-established classification schemes, such as the Chomsky hierarchy, with which we can measure the complexity of these sets of sequences, and thus the complexity of the systems which produce them. In this paper, we look at the first few levels of a hierarchy of complexity for two-or-more-di]<-- Enter an X to order article (TGA: 101ED 00004) ISSN: 0022-4715 --------mensional patterns. We show that several definitions of "regular 語言" or "local rule" that are equivalent in d = 1 lead to distinct classes in d greater than or equal to 2. We explore the closure properties and 計算 complexity of these classes, including undecidability and L, NL, an
※ 此為已發表論文，全文需透過期刊付費取得