Sciweavers

423 search results - page 31 / 85
» The Generalization of Generalized Automata: Expression Autom...
Sort
View
DLT
2007
13 years 10 months ago
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes determin...
Marcella Anselmo, Dora Giammarresi, Maria Madonia
STACS
2005
Springer
14 years 2 months ago
Pattern Occurrences in Multicomponent Models
Abstract. In this paper we determine some limit distributions of pattern statistics in rational stochastic models, defined by means of nondeterministic weighted finite automata. ...
Massimiliano Goldwurm, Violetta Lonati
FOSSACS
2004
Springer
14 years 2 months ago
On Recognizable Timed Languages
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
Oded Maler, Amir Pnueli
ANCS
2007
ACM
14 years 21 days ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
WWW
2005
ACM
14 years 9 months ago
Towards autonomic web-sites based on learning automata
Autonomics or self-reorganization becomes pertinent for websites serving a large number of users with highly varying workloads. An important component of self-adaptation is to mod...
Pradeep S, Chitra Ramachandran, Srinath Srinivasa