AbstractThe results and tools which were developed in Part I of this paper [4] are used to solve systems of recursive equations on hypergraphs and to characterize their solutions completely. A hypergraph's initial solutions are called equational hypergraphs. It is then shown that the context-free graphs of Muller and Schupp [15] are equational
AbstractWe define the class of the linear systems whose solution is expressible as a tuple of nondet...
AbstractA system Σ of recursion equations is a finite set of equations ϕi = ti i = 1,…, n, where the...
A set of containers for a hypergraph G is a collection CC of vertex subsets, such that for every i...
AbstractBasic properties of the category of infinite directed hyperedge-labelled hypergraphs are stu...
Abstract. Using rationality, like in language theory, we define a family of infinite graphs. This fa...
This work is dedicated to the study of infinite structures (or graphs) which admit a finite presenta...
AbstractGiven a finite hypergraph H = (V, E) and, for each e ϵ E, a collection of nonempty subsets π...
We analyse the problem of solving Boolean equation systems through the use of structure graphs. The ...
We analyse the problem of solving Boolean equation systems through the use of structure graphs. The ...
AbstractWe give the syntax and semantics of a language for expressing recursive systems of flowgraph...
A hypergraph is a generalization of a graph since, in a graph an edge relates only a pair of points,...
We define the class of the linear systems whose solution is expressible as a tuple of nondeterminist...
AbstractWe give a simple linear algebraic proof of the following conjecture of Frankl and Füredi [7,...
We analyze the problem of solving Boolean equation systems through the use of structure graphs. The ...
We define what it means for an equation to be graph-regular, extending the idea of partition- regul...
AbstractWe define the class of the linear systems whose solution is expressible as a tuple of nondet...
AbstractA system Σ of recursion equations is a finite set of equations ϕi = ti i = 1,…, n, where the...
A set of containers for a hypergraph G is a collection CC of vertex subsets, such that for every i...
AbstractBasic properties of the category of infinite directed hyperedge-labelled hypergraphs are stu...
Abstract. Using rationality, like in language theory, we define a family of infinite graphs. This fa...
This work is dedicated to the study of infinite structures (or graphs) which admit a finite presenta...
AbstractGiven a finite hypergraph H = (V, E) and, for each e ϵ E, a collection of nonempty subsets π...
We analyse the problem of solving Boolean equation systems through the use of structure graphs. The ...
We analyse the problem of solving Boolean equation systems through the use of structure graphs. The ...
AbstractWe give the syntax and semantics of a language for expressing recursive systems of flowgraph...
A hypergraph is a generalization of a graph since, in a graph an edge relates only a pair of points,...
We define the class of the linear systems whose solution is expressible as a tuple of nondeterminist...
AbstractWe give a simple linear algebraic proof of the following conjecture of Frankl and Füredi [7,...
We analyze the problem of solving Boolean equation systems through the use of structure graphs. The ...
We define what it means for an equation to be graph-regular, extending the idea of partition- regul...
AbstractWe define the class of the linear systems whose solution is expressible as a tuple of nondet...
AbstractA system Σ of recursion equations is a finite set of equations ϕi = ti i = 1,…, n, where the...
A set of containers for a hypergraph G is a collection CC of vertex subsets, such that for every i...
DOI
Add to ORKG