Recognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which compare the associated equational and recognizable sets. The basic algebra ...
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
The behavior of a network of communicating automata is called existentially bounded if communication events can be scheduled in such a way that the number of messages in transit is always bounded by a value that depends only on the machine, not the run ...
On modularity in infinitary term rewriting
We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that:*Confluence is not preserved across direct sum of a finite number of systems, even when these are non-collapsing. *Confluence modulo equality of ...
Mind change efficient learning
This paper studies efficient learning with respect to mind changes. Our starting point is the idea that a learner that is efficient with respect to mind changes minimizes mind changes not only globally in the entire learning problem, but also locally in ...
