Sökning: "regular tree languages"
Hittade 4 avhandlingar innehållade orden regular tree languages.
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. 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
3. Order-preserving graph grammars
Sammanfattning : The field of semantic modelling concerns formal models for semantics, that is, formal structures for the computational and algorithmic processing of meaning. This thesis concerns formal graph languages motivated by this field. LÄS MER
4. A novel approach to text classification
Sammanfattning : This thesis explores the foundations of text classification, using both empirical and deductive methods, with a focus on author identification and syntactic methods. We strive for a thorough theoretical understanding of what affects the effectiveness of classification in general. LÄS MER