Metraipolis › archive › dc_95df33f33c44

Grammar systems theory — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Grammar_systems_theory
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-05T23:47:22.310Z
SHA-256 of the archived text
90528eb13a8166aa03c51ba7753dec9e0a52efced2225aca2d4b6f3702535965
Stable URL of this page
https://metraipolis.com/documento/dc_95df33f33c44

How to cite

Grammar systems theory — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Grammar_systems_theory (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_95df33f33c44 (Metraipolis archive dc_95df33f33c44, sha256 90528eb13a8166aa03c51ba7753dec9e0a52efced2225aca2d4b6f3702535965)
BibTeX
@misc{dc95df33f33c44,
  title = {Grammar systems theory — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Grammar_systems_theory},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_95df33f33c44; sha256 90528eb13a8166aa03c51ba7753dec9e0a52efced2225aca2d4b6f3702535965},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Grammar_systems_theory. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Grammar systems theory is a field of theoretical computer science that studies systems of finite collections of formal grammars generating a formal language. Each grammar works on a string, a so-called sequential form that represents an environment. Grammar systems can thus be used as a formalization of decentralized or distributed systems of agents in artificial intelligence. Let A {\displaystyle \mathbb {A} } be a simple reactive agent moving on the table and trying not to fall down from the table with two reactions, t for turning and ƒ for moving forward. The set of possible behaviors of A {\displaystyle \mathbb {A} } can then be described as formal language L A = { ( f m t n f r ) + : 1 ≤ m ≤ k ; 1 ≤ n ≤ ℓ ; 1 ≤ r ≤ k } , {\displaystyle \mathbb {L_{A}} =\{(f^{m}t^{n}f^{r})^{+}:1\leq m\leq k;1\leq n\leq \ell ;1\leq r\leq k\},} where ƒ can be done maximally k times and t can be done maximally ℓ times considering the dimensions of the table. Let G A {\displaystyle \mathbb {G_{A}} } be a formal grammar which generates language L A {\displaystyle \mathbb {L_{A}} } . The behavior of A {\displaystyle \mathbb {A} } is then described by this grammar. Suppose the A {\displaystyle \mathbb {A} } has a subsumption architecture; each component of this architecture can be then represented as a formal grammar, too, and the final behavior of the agent is then described by this system of grammars. The schema on the right describes such a system of grammars which shares a common string representing an environment. The shared sequential form is sequentially rewritten by each grammar, which can represent either a component or generally an agent. If grammars communicate together and work on a shared sequential form, it is called a Cooperating Distributed (DC) grammar system. Shared sequential form is a similar concept to the blackboard approach in AI, which is inspired by an idea of experts solving some problem together while they share their proposals and ideas on a shared blackboard. Each grammar in a grammar system can also work on its own string and communicate with other grammars in a system by sending their sequential forms on request. Such a grammar system is then called a Parallel Communicating (PC) grammar system. PC and DC are inspired by distributed AI. If there is no communication between grammars, the system is close to the decentralized approaches in AI. These kinds of grammar systems are sometimes called colonies or Eco-Grammar systems, depending (besides others) on whether the environment is changing on its own (Eco-Grammar system) or not (colonies).

Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; categoria «Artificial intelligence»).
Fonte: Wikipedia in inglese, voce «Grammar systems theory» — https://en.wikipedia.org/wiki/Grammar_systems_theory
Wikidata Q5593671 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5593671
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Grammar_systems_theory?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1132613502, consultata il 2026-10-05T23:18:09.833Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 87feea0b8dc00fca6a2df5a0994c8bf7a598892d2305a0024119cb8b614ae931