M. Bauderon. Infinite hypergraph II, systems of recursive equations. TCS 103, pages 165--190, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is closely related to the notion of pushdown automaton) appears in several fields of theoretical computer science: originally in the frontier between formal language theory and combinatorial group theory ( Ani71, MS83, MS85] see [BB91, p. 95 100] for a survey) but also in algebraic graph theory ([Bau91, Bau92], see [Cou90a] for a survey) in model theory ( Cou89, Cou90b] see [Cou90a] for a survey) and in semantics of processes ( BBK87] Cau90a] CHS92] HJM94] see [Cau95] for a survey) The aim of this work is to study the structure of Hn Gamma where Gamma is a contextfree graph and H a group acting ....

M. Bauderon. Infinite hypergraph II, systems of recursive equations. TCS 103, pages 165--190, 1992.

....here, might have infinite in degree) This problem was raised in [Cau95] see Problem 6. 2 of this reference ) and in [Sti96] as the bisimulation problem for processes of type 1 ) Infinite graphs A wide class of graphs enjoying interesting decidability properties has been defined in [Cou89, Bau91, Bau92] (see [Cou90] for a survey) In particular it is known that the problem are Gamma; Gamma 0 isomorphic 00 is decidable for pairs Gamma; Gamma 0 of equational graphs. It seems quite natural to investigate whether the problem are Gamma; Gamma 0 bisimilar 00 is decidable for ....

M. Bauderon. Infinite hypergraph II, systems of recursive equations. TCS 103, pages 165--190, 1992.

....is closely related to the notion of pushdown automaton) appears in several fields of theoretical computer science: originally in the frontier between formal language theory and combinatorial group theory ( Ani71, MS83, MS85] see [BB91, p. 95 100] for a survey) but also in algebraic graph theory ([Bau91, Bau92], see [Cou90a] for a survey) in model theory ( Cou89, Cou90b] see [Cou90a] for a survey) and in semantics of processes ( BBK87] Cau90a] CHS92] HJM94] see [Cau95] for a survey) The aim of this work is to study the structure of Hn Gamma where Gamma is a contextfree graph and H a group acting ....

M. Bauderon. Infinite hypergraph II, systems of recursive equations. TCS 103, pages 165--190, 1992.

....node Interface a family of nodes a set of edges Connection glues interface nodes creates interface edges Algebraic framework Available Available Categorical approach Available None Logical Theory Available Available Fig. 1. Hyperedge vs. Vertex replacement of recursive equations (c.f. [3, 4]) from the edge rewriting to the node rewriting context, we had to develop a new theory which would provide us with a notion of approximation for these infinite graphs. We knew from [3] that the only possible approach what to use an appropriate categorical framework and started to try and fill the ....

M. Bauderon, Infinite Hypergraphs II. Systems of recursive equations, Theor. Comput. Sci 103 (1993) 165-190

....interface nodes creates interface edges Algebraic framework Available Available Categorical approach Available None Logical Theory Available Available Fig. 1. Hyperedge vs. Vertex replacement Trying to extend earlier works on infinite hypergraphs generated by systems of recursive equations (c.f. [1, 2]) from the edge rewriting to the node rewriting context, we had to develop a new theory which would provide us with a notion of approximation for these infinite graphs. We knew from [1] that a categorical framework was necessary and it turned out that it was a complete category instead of a ....

M. Bauderon, Infinite Hypergraphs II. Systems of recursive equations, Theor. Comput. Sci 103 (1993) 165-190

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC