Essays about: "Finite automata"

Showing result 1 - 5 of 10 essays containing the words Finite automata.

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

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

    Author : Meghashyam Veluvali; [2023]
    Keywords : Mathematical modelling of pedestrian dynamics; stochastic systems; evacuation time; random walk method; parabolic equation; finite difference method;

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

  2. 2. Shortcut Transformers and the Learnability of Automata

    University essay from Umeå universitet/Institutionen för datavetenskap

    Author : Willeke Martens; [2023]
    Keywords : transformers; modern neural networks; automata; expressivity; learnability; regular languages; solvable groups;

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

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

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Marco Dei Rossi; [2021]
    Keywords : Automata learning; SL*; Register automata; RALib; Lateral State Manager; Automata learning; SL*; Register automata; RALib; LSM; Automata learning; SL*; Register automata; RALib; LSM;

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

  4. 4. Phonotactic Structures in Swedish : A Data-Driven Approach

    University essay from Stockholms universitet/Institutionen för lingvistik

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

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

  5. 5. Monomial Cellular Automata : A number theoretical study on two-dimensional cellular automata in the von Neumann neighbourhood over commutative semigroups

    University essay from Linnéuniversitetet/Institutionen för matematik (MA)

    Author : Linnea Fransson; [2016]
    Keywords : cellular automata; monomial; multiplicative; two-dimensional; von Neumann neighbourhood; number theory;

    Abstract : In this report, we present some of the results achieved by investigating two-dimensional monomial cellular automata modulo m, where m is a non-zero positive integer. Throughout the experiments, we work with the von Neumann neighbourhood and apply the same local rule based on modular multiplication. READ MORE