68 search results - page 2 / 14 » Open Graphs and Monoidal Theories |
CORR
2006
Springer
13 years 6 months ago
2006
Springer
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
COMBINATORICS
2004
13 years 6 months ago
2004
The Ramsey game we consider in this paper is played on an unbounded set of vertices by two players, called Builder and Painter. In one move Builder introduces a new edge and Paint...
CSL
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. A longstanding open problem is whether there exists a nonsyntactical model of the untyped -calculus whose theory is exactly the least -theory . In this paper we investiga...
IJAC
2011
12 years 10 months ago
2011
We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good ca...
CSL
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...