Properties of NLC Languages Squeezed with Hypercube Graphs

The hypercube is a generalization of 3-cube to n dimensions, also called an n-cube or measure polytope. In this paper we define boundary edNCE recursive graph grammar and generate the language for the hypercube. For a graph grammar G with a graph-theoretical property ψ, let L ψ (G) Ψ be the language L(G) squeezed with ψ i.e., L(G) ΩL(ψ). This paper presents result on language-theoretic properties (such as membership and other decision properties) of NLC, B-edNCE languages squeezed with hyper cube graphs. We show that L Q n (G) is in NP complete.