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 “"automata and logic"”.
-
Finite automata on unranked trees : extensions by arithmetical and equality constraints
… 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 previously been shown for the ranked-tree setting have turned out to hold for the unranked-tree setting as well. In this …
-
Automatic presentations of infinite structures
The work at hand studies the possibilities and limitations of the use of finite automata in the description of infinite structures. An automatic presentation of a countable structure consists of a labelling of the elements of the structure by finite words over a finite alphabet in a consistent way …