Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"monadische Logik zweiter Stufe"”.
-
Automata-based decision procedures for weak arithmetics
Around forty years ago, mathematicians such as Büchi and Rabin <br>discovered that automata are a useful mathematical tool for <br>understanding the decidability of different weak systems of <br>arithmetic. A prominent example is the weak monadic second-order logic <br>of one successor, WS1S for …
-
Finite automata on unranked trees : extensions by arithmetical and equality constraints
The notion of unranked trees has attracted much interest in current research, especially due to their application as formal models of XML documents. In particular, several automata and logic formalisms on unranked trees have been considered (again) in the literature, and many results that had …