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.
Obviously, such a partitioning exists because| |J2| | ≥π0(s0)
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.