181 search results - page 9 / 37 » On Quantification with A Finite Universe |
82
Voted
FUIN
2008
14 years 11 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
107
click to vote
CONCUR
2008
Springer
15 years 1 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
102
click to vote
NC
2008
14 years 11 months ago
2008
We consider spiking neural P systems with rules allowed to introduce zero, one, or more spikes at the same time. The motivation comes both from constructing small universal systems...
COMBINATORICA
2006
14 years 11 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
75
Voted
IGPL
2008
14 years 11 months ago
2008
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...