762 search results - page 94 / 153 » Intercode Regular Languages |
111
click to vote
DLT
2006
15 years 3 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 ...
130
click to vote
FSTTCS
2010
Springer
15 years 13 days 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 ...
130
Voted
QEST
2006
IEEE
15 years 8 months ago
2006
IEEE
LiQuor is a tool for verifying probabilistic reactive systems modelled Probmela programs, which are terms of a probabilistic guarded command language with an operational semantics...
98
Voted
TACS
2001
Springer
15 years 6 months ago
2001
Springer
Decidability of non-structural subtype entailment is a long standing open problem in programming language theory. In this paper, we apply automata theoretic methods to characterize...
119
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Signals are a classical tool of cellular automata constructions that proved to be useful for language recognition or firing-squad synchronisation. Particles and collision...