15 search results - page 1 / 3 » Iteration Algebras Are Not Finitely Axiomatizable. Extended ... |
LATIN
2000
Springer
13 years 8 months ago
2000
Springer
LICS
2010
IEEE
13 years 2 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
SIAMDM
2010
12 years 11 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
CSR
2008
Springer
13 years 6 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...
DALT
2005
Springer
13 years 10 months ago
2005
Springer
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...