400 search results - page 11 / 80 » Rational stochastic languages |
GG
2004
Springer
14 years 1 months ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
ENTCS
2002
13 years 7 months ago
2002
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
SIGCOMM
2009
ACM
14 years 2 months ago
2009
ACM
Network management operations are complicated, tedious and error-prone, requiring significant human involvement and expert knowledge. In this paper, we first examine the fundame...
CCR
2010
13 years 7 months ago
2010
Network management operations are complicated, tedious and error-prone, requiring significant human involvement and expert knowledge. In this paper, we first examine the fundament...
AML
2010
13 years 7 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...