ABSTRACT
Problem 1 . ([146]) How do properties o f graph labelings determine prop erties o f classes of languages defined on these graphs?
Problem 2. ([146]) When is the class o f languages recognised by two-sided automata o f bipartite graphs closed for intersection, union, complement, concatenation and the Kleene star operation?
