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 “"Presburger-Arithmetik"”.
-
Automata-based decision procedures for weak arithmetics
… such logical <br>theories. A notable example is Presburger arithmetic for which <br>effective decision procedures can be built using automata. Despite <br>the practical use of automata, many research questions in the <br>automata-based approach to decide weak systems of arithmetic are open. …
-
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 …