Recognizable sets of series-parallel graphs admit regular grammar representations whose corresponding finite algebras are singly exponential in grammar size, yielding ExpTime-complete decision procedures for intersection and inclusion.
⇐” This direction uses a symmetric argument. Lemma 1.his a homomorphism betweenSPandA. Proof (Proof of Lemma 1).We prove several points, for alla∈ΣandG 1, G2 ∈ SP: h(aSP ) =a A: “⊆
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
Recognizable sets of series-parallel graphs admit regular grammar representations whose corresponding finite algebras are singly exponential in grammar size, yielding ExpTime-complete decision procedures for intersection and inclusion.