Search for dissertations about: "regular tree"

Showing result 1 - 5 of 20 swedish dissertations containing the words regular tree.

  2. 1. Contributions to the theory and applications of tree languages

    Author : Johanna Högberg; Frank Drewes; Manfred Droste; Umeå universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; regular tree languages; tree series; algorithmic learning; MAT-learning; bisimulation minimisation; tree-based generation; algorithmic composition; music algebra; Computer science; Datalogi;

    Abstract : 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. READ MORE

  4. 2. Harmonic measures

    Author : Jonatan Vasilis; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; harmonic measure; square root of the Poisson kernel; Hardy space; p-Laplace operator; random walk; regular tree; discrete minimal thinness; Hardy space;

    Abstract : 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. READ MORE

  5. 3. Simplicial Complexes of Graphs

    Author : Jakob Jonsson; Anders Björner; John Shareshian; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Algebra and geometry; simplicial complex; monotone graph property; discrete Morse theory; simplicial homology; homotopy type; connectivity degree; Cohen-Macaulay complex; Euler characteristic; decision tree; Algebra och geometri; Algebra and geometry; Algebra och geometri;

    Abstract : 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. READ MORE

  6. 4. Learning of Timed Systems

    Author : Olga Grinchtein; Bengt Jonsson; Oded Maler; Uppsala universitet; []
    Keywords : learning regular languages; timed systems; event-recording automata;

    Abstract : 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. READ MORE

  7. 5. Parameterized Systems : Generalizing and Simplifying Automatic Verification

    Author : Ahmed Rezine; Parosh Aziz Abdulla; Kedar Namjoshi; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Parameterized systems; Automatic verification; Approximation; Regular model checking; Safety; Termination; Computer science; Datavetenskap; Datavetenskap; Computer Science;

    Abstract : 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. READ MORE