346 search results - page 36 / 70 » Determinizing Asynchronous Automata |
101
click to vote
IEEESCC
2005
IEEE
15 years 3 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
JUCS
2010
14 years 8 months ago
2010
: We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documen...
JALC
2007
14 years 10 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
DC
2007
14 years 10 months ago
2007
d bins abstraction and works in two phases. The main novelty of the work is in the first phase where the number of contending processes is reduced in a controlled manner. Probabil...
NECO
2010
14 years 8 months ago
2010
The roles of inhibitory neurons in synchronous firing are examined in a network of excitatory and inhibitory neurons with Watts and Strogatz’s rewiring. By examining the persis...