426 search results - page 71 / 86 » Synchronization of Regular Automata |
DLT
2006
14 years 11 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
IANDC
2011
14 years 4 months ago
2011
We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative ...
116
click to vote
DLT
2010
14 years 11 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...
120
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper proposes a novel approach to motion capture
from multiple, synchronized video streams, specifically
aimed at recording dense and accurate models of the structure
and ...