15614 search results - page 298 / 3123 » The State of State |
159
click to vote
COCO
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs in time k where is...
175
click to vote
CONCUR
2000
Springer
15 years 10 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
165
click to vote
ECOOPW
2000
Springer
15 years 10 months ago
2000
Springer
Previous workshops on reflection both in ECOOP and in OOPSLA have pointed out the growing interest and importance of Reflection and Metalevel Architectures in the fields of program...