Sciweavers

57 search results - page 5 / 12
» On Stateless Automata and P Systems
Sort
View
VOSS
2004
Springer
125views Mathematics» more  VOSS 2004»
14 years 25 days ago
Probabilistic Automata: System Types, Parallel Composition and Comparison
We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper...
Ana Sokolova, Erik P. de Vink
ACRI
2000
Springer
13 years 12 months ago
A Multi-Agent Cellular Automata System for Visualising Simulated Pedestrian Activity
This paper describes the first impressions of the development of a multi-agent system that can be used for visualising simulated pedestrian activity and behaviour to support the a...
J. Dijkstra, Harry J. P. Timmermans, J. Jessurun
JAC
2008
13 years 9 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
QEST
2008
IEEE
14 years 1 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
TSMC
2002
156views more  TSMC 2002»
13 years 7 months ago
Varieties of learning automata: an overview
Automata models of learning systems introduced in the 1960s were popularized as learning automata (LA) in a survey paper in 1974 [1]. Since then, there have been many fundamental a...
M. A. L. Thathachar, P. Shanti Sastry