Formal language recognition by stochastic cellular automata

• Autorzy: Merkle D. , Worsch T.
• Języki publikacji: EN

Abstrakty

EN

We present two generalizations of cellular automata where transitions from one configuration to the next are no longer deterministic but depend on some element of randomization. The main topic is a model which not only takes into account the probabilities of cells being in certain states but also their dependencies. It formalizes the approach of ``randomized simulations'' often used for the modeling of real phenomena. In this paper the power of stochastic CA as language recognizers is investigated. Generalizations of well-known tools (stochastic signals and product automata) are used to prove that stochastic CA are strictly more powerful than deterministic CA and stochastic finite automata (which are known to recognize uncountably many languages).

Słowa kluczowe

EN

cellular automata; formal languages

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2002
• Tom: Vol. 52, nr 1-3
• Strony: 183--201
• Opis fizyczny: bibliogr. 12 poz.

Twórcy

autor

Merkle D.

autor

Worsch T.

• Institut für Angewandte Informatik und Formale Beschreibungsverfahren (AIFB), Universität Karlsruhe (TH), Kolleggiengebäude am Ehrenhof Englerstrasse, 11 D-76131 Karlsruhe, Germany,