Advertisement

Acta Informatica

, Volume 37, Issue 9, pp 619–632 | Cite as

Efficient recognition algorithms for boundary and linear eNCE graph languages

  • Changwook Kim
Original articles

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.”

Keywords

Recognition Algorithm Degree Bound Graph Language Efficient Recognition eNCE Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Changwook Kim
    • 1
  1. 1.School of Computer Science, University of Oklahoma, Norman, OK 73019, USA (e-mail: ckim@ou.edu) US

Personalised recommendations