Sökning: "regular tree"
Visar resultat 1 - 5 av 20 avhandlingar innehållade orden regular tree.
1. Contributions to the theory and applications of tree languages
Sammanfattning : This thesis is concerned with theoretical as well as practical aspects of tree languages. It consists of an introduction and eight papers, organised into three parts. LÄS MER
2. Harmonic measures
Sammanfattning : This thesis uses both analytic and probabilistic methods to study continuous and discrete problems. The main areas of study are the asymptotic properties of p-harmonic measure, and various aspects of the square root of the Poisson kernel. Fix a domain and a boundary point, subject to certain regularity conditions. LÄS MER
3. Simplicial Complexes of Graphs
Sammanfattning : Let G be a finite graph with vertex set V and edge set E. A graph complex on G is an abstract simplicial complex consisting of subsets of E. In particular, we may interpret such a complex as a family of subgraphs of G. LÄS MER
4. Learning of Timed Systems
Sammanfattning : Regular inference is a research direction in machine learning. The goal of regular inference is to construct a representation of a regular language in the form of deterministic finite automaton (DFA) based on the set of positive and negative examples. LÄS MER
5. Parameterized Systems : Generalizing and Simplifying Automatic Verification
Sammanfattning : In this thesis we propose general and simple methods for automatic verification of parameterized systems. These are systems consisting of an arbitrary number of identical processes or components. The number of processes defines the size of the system. LÄS MER