Search for dissertations about: "regular expressions"

Showing result 1 - 5 of 17 swedish dissertations containing the words regular expressions.

  2. 1. Complexities of Order-Related Formal Language Extensions

    Author : Martin Berglund; Frank Drewes; Henrik Björklund; Markus Holzer; Umeå universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; complexity; automata; languages; order; shuffle; regular expressions; context-free; mildly context-sensitive; parsing; membership; algorithm analysis; Computer Science; datalogi;

    Abstract : The work presented in this thesis discusses various formal language formalisms that extend classical formalisms like regular expressions and context-free grammars with additional abilities, most relating to order. This is done while focusing on the impact these extensions have on the efficiency of parsing the languages generated. READ MORE

  4. 2. Programming Language Design - Issues in Web Programming and Security

    Author : Niklas Broberg; Göteborgs universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Functional programming; web programming; dynamic loading; regular expressions; security; non-interference; calculus; core calculus; bisimulation; calculus;

    Abstract : This thesis consists of two separate parts. Both concern programming language design, the first in the domain of web programming and the other for security. READ MORE

  5. 3. Verifying Absence of ∞ Loops in Parameterized Protocols

    Author : Mayank Saksena; Bengt Jonsson; Ahmed Bouajjani; Uppsala universitet; []
    Keywords : formal methods; verification; model checking; infinite-state systems; regular model checking; liveness; graph transformation;

    Abstract : The complex behavior of computer systems offers many challenges for formal verification. The analysis quickly becomes difficult as the number of participating processes increases. A parameterized system is a family of systems parameterized on a number n, typically representing the number of participating processes. READ MORE

  6. 4. Complexities of Parsing in the Presence of Reordering

    Author : Martin Berglund; Frank Drewes; Bruce Watson; Umeå universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; parsing; membership problems; complexity theory; reordering; shuffle; mildly context-sensitive; formal languages; Computer Science; datalogi;

    Abstract : The work presented in this thesis discusses various formalisms for representing the addition of order-controlling and order-relaxing mechanisms to existing formal language models. An immediate example is shuffle expressions, which can represent not only all regular languages (a regular expression is a shuffle expression), but also features additional operations that generate arbitrary interleavings of its argument strings. READ MORE

  7. 5. A novel approach to text classification

    Author : Niklas Zechner; Johanna Björklund; Efstathios Stamatatos; Umeå universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Text classification; natural language processing; automata; Computer Science; datalogi;

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