Loading...

Investigation of Graph Languages in Monadic Second Order Logic and ∆-regular Graph Automaton

Pourasghar, Babak | 2014

331 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 46204 (02)
  4. University: Sharif University of Technology
  5. Department: Mathematical Sciences
  6. Advisor(s): Ardeshir, Mohammad; Ramezanian, Rasoul
  7. Abstract:
  8. In this thesis, we study monadic second order logic and the languages of graphs. We introduce the notion of ∆- regular graph automaton. Then we designed this finite automaton for processing on labeled graphs. Definability of graph languages which are recognizable by this automaton is shown. To do this, we first briefly introduced monadic second order logic, and then we studied definability of regular string and tree languages in monadic second order logic. In the last section of thesis, ∆- regular graph automaton is introduced
  9. Keywords:
  10. Monadic Second Order Logic ; Finite Automata ; Graph Automata ; Tree Automata ; Definability

 Digital Object List

 Bookmark

No TOC