178 search results - page 24 / 36 » Boolean Algebras in Visser Algebras |
ICNP
2007
IEEE
15 years 4 months ago
2007
IEEE
- A Network Court Protocol is designed for malicious node conviction based on information from network node accusing and testifying operations, which are formally modeled by algebr...
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
CSR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Deterministic graph grammars are finite devices which generate the transition graphs of pushdown automata. We define the notion of synchronization by grammars, generalizi...
103
click to vote
CASC
2009
Springer
14 years 10 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
AML
2008
14 years 9 months ago
2008
We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theorie...