### A binomial representation of the 3x + 1 problem

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

Back to Simple Search
# Advanced Search

Given two trees (a target and a pattern ) and a natural number , consist in deciding whether occurs as an embedded subtree of and/or finding the number of size (at most) windows of which contain pattern as an embedded subtree. is an embedded subtree of if can be obtained by deleting some nodes from (if a node is deleted, all edges adjacent to are also deleted, and outgoing edges are replaced by edges going from the parent of (if it exists) to the children of ). Deciding whether ...

**Page 1**