1650 search results - page 302 / 330 » The HOM problem is decidable |
PODC
1999
ACM
13 years 12 months ago
1999
ACM
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We are mainly interested in two types of systems: anonymous systems and id-based systems. We...
CAV
1999
Springer
13 years 12 months ago
1999
Springer
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
ELPUB
1998
ACM
13 years 12 months ago
1998
ACM
The rapid growth in all forms of electronic publishing is creating many new problems – both technical and socio-economic. This paper examines some of these from three different ...
NSPW
1998
ACM
13 years 12 months ago
1998
ACM
Object-based programming is becoming more and more popular and is currently conquering the world of distributed programming models. In object-based systems access control is often...
LATA
2010
Springer
13 years 11 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...