26 citations · 26 across the 2 of their papers we have counts for
2 papers
cs.DM2008
Distributing Labels on Infinite Trees
Nicolas Gast, Bruno Gaujal
Sturmian words are infinite binary words with many equivalent definitions: They have a minimal factor complexity among all aperiodic sequences; they are balanced sequences (the lab…
cs.OH2007★ 26 cited
Blocking a transition in a Free Choice net and what it tells about its throughput
Bruno Gaujal, Stefan Haar, Jean Mairesse
In a live and bounded Free Choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected o…