Efficient recognition algorithms for boundary and linear eNCE graph languages
- 29 Downloads
It is well known that every boundary (linear) eNCE graph language that is connected and degree-bounded by a constant is in LOGCFL (NLOG). The present paper proves an upper bound of the complexity of boundary (linear) eNCE graph languages whose component and degree bounds are functions in the size of the graph. As a corollary of this analysis, the known LOGCFL and NLOG results stated above hold even if “connected” is replaced by “component-bounded by log n.”
KeywordsRecognition Algorithm Degree Bound Graph Language Efficient Recognition eNCE Graph
Unable to display preview. Download preview PDF.