Sciweavers

JCT
1998
99views more  JCT 1998»
13 years 11 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 11 months ago
Transforming structures by set interpretations
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas w...
Thomas Colcombet, Christof Löding
BIRTHDAY
2004
Springer
14 years 5 months ago
A Proof of Regularity for Finite Splicing
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
Vincenzo Manca
DALT
2005
Springer
14 years 5 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki