Sökning: "regular expressions"
Visar resultat 1 - 5 av 19 avhandlingar innehållade orden regular expressions.
1. Complexities of Order-Related Formal Language Extensions
Sammanfattning : 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. LÄS MER
2. Programming Language Design - Issues in Web Programming and Security
Sammanfattning : 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. LÄS MER
3. Verifying Absence of ∞ Loops in Parameterized Protocols
Sammanfattning : 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. LÄS MER
4. "Den Evangeliska Mariavägen till enhet" : En studie av Paulina Mariadotters spiritualitet
Sammanfattning : The dissertation deals with the mid-twentieth century development of regulated religious life in the Church of Sweden and how this was expressed in the Congregation of the Daughters of Mary of the Evangelical Way of Mary. It focuses on the foundress’ spirituality and the importance of this for the shaping of monastic life, as well as on the significance of mystic and prophetic experience for that spirituality. LÄS MER
5. Complexities of Parsing in the Presence of Reordering
Sammanfattning : 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. LÄS MER