Sökning: "Finite Automata"

Visar resultat 1 - 5 av 11 uppsatser innehållade orden Finite Automata.

  1. 1. Moving in the dark : Mathematics of complex pedestrian flows

    Magister-uppsats, Karlstads universitet/Fakulteten för hälsa, natur- och teknikvetenskap (from 2013)

    Författare :Meghashyam Veluvali; [2023]
    Nyckelord :Mathematical modelling of pedestrian dynamics; stochastic systems; evacuation time; random walk method; parabolic equation; finite difference method;

    Sammanfattning : The field of mathematical modelling for pedestrian dynamics has attracted significant scientific attention, with various models proposed from perspectives such as kinetic theory, statistical mechanics, game theory and partial differential equations. Often such investigations are seen as being a part of a new branch of study in the domain of applied physics, called sociophysics. LÄS MER

  3. 2. Shortcut Transformers and the Learnability of Automata

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Willeke Martens; [2023]
    Nyckelord :transformers; modern neural networks; automata; expressivity; learnability; regular languages; solvable groups;

    Sammanfattning : Transformers have emerged as a powerful architecture for various tasks in natural language processing, computer vision, and multi-modal domains. Despite their success, understanding the computational capabilities and limitations of transformers remains a challenge. LÄS MER

  4. 3. Automatically Learning Register Automata from MATLAB Code : A case study in autonomous driving

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Marco Dei Rossi; [2021]
    Nyckelord :Automata learning; SL*; Register automata; RALib; Lateral State Manager; Automata learning; SL*; Register automata; RALib; LSM; Automata learning; SL*; Register automata; RALib; LSM;

    Sammanfattning : The successful verification of the behaviour of an Autonomous driving (AD) vehicle is fundamental for the commercialization of this new technology. Formal verification can be used to exhaustively verify the correctness of a system, but it requires a formal model to do so. LÄS MER

  5. 4. Menings- och dokumentklassficering för identifiering av meningar

    Kandidat-uppsats, Högskolan i Skövde/Institutionen för informationsteknologi

    Författare :Jörgen Paulson; Peter Huynh; [2018]
    Nyckelord :natural language processing; classification; finite state automata; språkteknologi; klassificering; tillståndsmaskiner;

    Sammanfattning : Detta examensarbete undersöker hur väl tekniker inom meningsklassificering och dokumentklassificering fungerar för att välja ut meningar som innehåller de variabler som använts i experiment som beskrivs i medicinska dokument. För meningsklassificering används tillståndsmaskiner och nyckelord, för dokumentklassificering används linjär SVM och Random forest. LÄS MER

  7. 5. Phonotactic Structures in Swedish : A Data-Driven Approach

    Magister-uppsats, Stockholms universitet/Institutionen för lingvistik

    Författare :Felix Hultin; [2017]
    Nyckelord :Phonotactics; computational phonology; trie; finite automata; pattern matching; regular languages; Fonotax; beräkningsbar fonologi; trie; ändlig automat; mönstermatchning; reguljära språk;

    Sammanfattning : Ever since Bengt Sigurd laid out the first comprehensive description of Swedish phonotactics in 1965, it has been the main point of reference within the field. This thesis attempts a new approach, by presenting a computational and statistical model of Swedish phonotactics, which can be built by any corpus of IPA phonetic script. LÄS MER