Abstract.
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.”
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 15 January 1997 / 17 January 2001
Rights and permissions
About this article
Cite this article
Kim, C. Efficient recognition algorithms for boundary and linear eNCE graph languages. Acta Informatica 37, 619–632 (2001). https://doi.org/10.1007/PL00013320
Issue Date:
DOI: https://doi.org/10.1007/PL00013320