The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
New compact representations of infinite graphs are investigated. Finite automata are used to represent labelled hyper-graphs which can be also multi-graphs. Our approach consists of a general framework where vertices are represented by a regular prefix-free language and edges are represented by a regular language and a function over tuples. We consider three different functions over tuples: given a tuple the first function returns its first difference, the second one returns its suffix and the last...
New compact representations of infinite graphs are
investigated. Finite automata are used to represent labelled hyper-graphs
which can be also multi-graphs. Our approach consists of a general
framework where vertices are represented by a regular prefix-free language and
edges are represented by a regular language and a function over tuples.
We consider three different functions over tuples:
given a tuple
the first function returns its
first difference, the second one returns its suffix and...
Currently displaying 61 –
63 of
63