2.00 pm, Lecture Hall 3 M.Sc. Thesis Defence Graph automata and tree-width Adwitee Roy Chennai Mathematical Institute. 17-05-17 Abstract It is a survey talk on graph automata and tree-width. First, we study graph automata and multiply nested words with some examples. Then we see that the emptiness and finiteness of graph automata and multiply nested words are undecidable and they become decidable when the graphs have bounded tree-width.
|