16 search results - page 3 / 4 » Coalgebraic Automata Theory: Basic Results |
CSL
2007
Springer
13 years 11 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
IANDC
2006
13 years 7 months ago
2006
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
STACS
1997
Springer
13 years 11 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
JUCS
2002
13 years 6 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...