A hyperstring is a simple semi-Hamiltonian acyclic digraph 
with a labeling of the edges in 
such that, for all vertices 
, either 
or 
, where a set 
is the set of label strings represented by the paths
.
Hyperstring
See also
Acyclic Digraph, Transparallel ProcessingThis entry contributed by Peter van der Helm
Explore with Wolfram|Alpha
References
van der Helm, P. A. "Transparallel Processing by Hyperstrings." Proc. Nat. Acad. Sci. USA 101, 10862-10867, 2004.Referenced on Wolfram|Alpha
HyperstringCite this as:
van der Helm, Peter. "Hyperstring." From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/Hyperstring.html