"elementary cellular automaton" meaning in All languages combined

See elementary cellular automaton on Wiktionary

Noun [English]

Forms: elementary cellular automata [plural], elementary cellular automatons [plural]
Head templates: {{en-noun|elementary cellular automata|s}} elementary cellular automaton (plural elementary cellular automata or elementary cellular automatons)
  1. (cellular automata) A one-dimensional, two-state cellular automaton in which a cell's state in the next generation depends only on its current state and the states of its two immediate neighbours. Wikipedia link: elementary cellular automaton Categories (topical): Cellular automata Related terms: Rule 110, Rule 184, Rule 30, Rule 90
    Sense id: en-elementary_cellular_automaton-en-noun-E7xvHQ0Q Categories (other): English entries with incorrect language header Topics: cellular-automata, computing, engineering, mathematics, natural-sciences, physical-sciences, sciences

Inflected forms

Download JSON data for elementary cellular automaton meaning in All languages combined (1.8kB)

{
  "forms": [
    {
      "form": "elementary cellular automata",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "elementary cellular automatons",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "elementary cellular automata",
        "2": "s"
      },
      "expansion": "elementary cellular automaton (plural elementary cellular automata or elementary cellular automatons)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Cellular automata",
          "orig": "en:Cellular automata",
          "parents": [
            "Mathematics",
            "Theory of computing",
            "Formal sciences",
            "Computer science",
            "Sciences",
            "Computing",
            "All topics",
            "Technology",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A one-dimensional, two-state cellular automaton in which a cell's state in the next generation depends only on its current state and the states of its two immediate neighbours."
      ],
      "id": "en-elementary_cellular_automaton-en-noun-E7xvHQ0Q",
      "links": [
        [
          "cellular automata",
          "cellular automata"
        ],
        [
          "one-dimensional",
          "one-dimensional"
        ],
        [
          "state",
          "state"
        ],
        [
          "cellular automaton",
          "cellular automaton"
        ],
        [
          "generation",
          "generation"
        ],
        [
          "neighbour",
          "neighbour"
        ]
      ],
      "raw_glosses": [
        "(cellular automata) A one-dimensional, two-state cellular automaton in which a cell's state in the next generation depends only on its current state and the states of its two immediate neighbours."
      ],
      "related": [
        {
          "word": "Rule 110"
        },
        {
          "word": "Rule 184"
        },
        {
          "word": "Rule 30"
        },
        {
          "word": "Rule 90"
        }
      ],
      "topics": [
        "cellular-automata",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "elementary cellular automaton"
      ]
    }
  ],
  "word": "elementary cellular automaton"
}
{
  "forms": [
    {
      "form": "elementary cellular automata",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "elementary cellular automatons",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "elementary cellular automata",
        "2": "s"
      },
      "expansion": "elementary cellular automaton (plural elementary cellular automata or elementary cellular automatons)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "Rule 110"
    },
    {
      "word": "Rule 184"
    },
    {
      "word": "Rule 30"
    },
    {
      "word": "Rule 90"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "en:Cellular automata"
      ],
      "glosses": [
        "A one-dimensional, two-state cellular automaton in which a cell's state in the next generation depends only on its current state and the states of its two immediate neighbours."
      ],
      "links": [
        [
          "cellular automata",
          "cellular automata"
        ],
        [
          "one-dimensional",
          "one-dimensional"
        ],
        [
          "state",
          "state"
        ],
        [
          "cellular automaton",
          "cellular automaton"
        ],
        [
          "generation",
          "generation"
        ],
        [
          "neighbour",
          "neighbour"
        ]
      ],
      "raw_glosses": [
        "(cellular automata) A one-dimensional, two-state cellular automaton in which a cell's state in the next generation depends only on its current state and the states of its two immediate neighbours."
      ],
      "topics": [
        "cellular-automata",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "elementary cellular automaton"
      ]
    }
  ],
  "word": "elementary cellular automaton"
}

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-16 from the enwiktionary dump dated 2024-05-02 using wiktextract (e268c0e and 304864d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.