Regular grammars yield singly-exponential recognizer algebras for recognizable SP-graph sets, establishing EXPTIME-completeness for intersection and inclusion.
Cambridge university press (2001)
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
Regular grammars yield singly-exponential recognizer algebras for recognizable SP-graph sets, establishing EXPTIME-completeness for intersection and inclusion.