3122 search results - page 38 / 625 » A Theory of Network Equivalence |
MFCS
1993
Springer
15 years 1 months ago
1993
Springer
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
MLQ
2000
14 years 9 months ago
2000
It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic [2]. In the special case of quasivarieties a direct tran...
133
click to vote
Book
The book covers several topics such as Acyclic Networks, Cyclic Networks, Network Coding and Algebraic Coding, Superposition Coding and Max-Flow Bound, Network Codes for Acyclic Ne...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we provide an automaton-based solution to the decision problem for a large set of monadic second-order theories of deterministic tree structures. We achieve it in two...