Computer Science – Formal Languages and Automata Theory
Scientific paper
2012-01-16
Computer Science
Formal Languages and Automata Theory
44 pages
Scientific paper
We present a pumping lemma for each level of the collapsible pushdown graph
hierarchy in analogy to the second author's pumping lemma for higher-order
pushdown graphs (without collapse). As a corollary we obtain the first proof
that the hierarchy is strict.
Kartzow Alexander
Parys Paweł
No associations
LandOfFree
Strictness of the Collapsible Pushdown Hierarchy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Strictness of the Collapsible Pushdown Hierarchy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strictness of the Collapsible Pushdown Hierarchy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-410094