Login / Signup
A Pumping Lemma for Pushdown Graphs of Any Level.
Pawel Parys
Published in:
STACS (2012)
Keyphrases
</>
machine learning
high level
graph theoretic
subgraph isomorphism
database
neural network
artificial intelligence
probabilistic model
levels of abstraction
structured objects