Nondeterministic walks generalize lattice paths by using set-valued steps whose reachable endpoint sets yield algebraic generating functions for bridges, excursions, and meanders on Dyck/Motzkin steps, with extensions and a conjecture for general steps backed by code packages.
Transition from IPv4 to IPv6: A state-of-the-art survey.IEEE Communications Surveys & Tutorials, 15(3):1407–1424
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Combinatorics of nondeterministic walks
Nondeterministic walks generalize lattice paths by using set-valued steps whose reachable endpoint sets yield algebraic generating functions for bridges, excursions, and meanders on Dyck/Motzkin steps, with extensions and a conjecture for general steps backed by code packages.