Loading...
Search for:
definability
0.044 seconds
Investigation of Graph Languages in Monadic Second Order Logic and ∆-regular Graph Automaton
, M.Sc. Thesis Sharif University of Technology ; Ardeshir, Mohammad (Supervisor) ; Ramezanian, Rasoul (Co-Advisor)
Abstract
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