Essays about: "regular languages"

Showing result 1 - 5 of 29 essays containing the words regular languages.

  1. 1. Comparing the Performance of Compiled vs Interpreted RegEx

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

    Author : Simon Hocker; Andreas Hammarstrand; [2023]
    Keywords : Compilers; Interpreters; Regular languages; RegEx; Performance; Kompilatorer; Tolkare; Regulära språk; RegEx; Prestanda;

    Abstract : The Regular Expression (RegEx) is one of the most important computer science technologies used for searching through text. Used commonly in almost every corner of computer science that is dependent on searching, it is imperative that they are made to be efficient. Usually, RegEx are implemented through the use of a process called interpretation. READ MORE

  3. 2. One Compiler to Rule Them All : Extending the Storm Programming Language Platform with a Java Frontend

    University essay from Linköpings universitet/Institutionen för datavetenskap

    Author : Simon Ahrenstedt; Daniel Huber; [2023]
    Keywords : storm; language technology; context free grammar; regular language; context free language; compiler; action research; EBNF; BNF; intermediate code generation; parser; basic storm; java compiler frontend; syntax language; syntax transformation;

    Abstract : The thesis aims to develop a method for extending the language platform Storm with a Java frontend.The project was conducted using an Action Research methodology and highlights triumphs andchallenges. READ MORE

  4. 3. 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

  5. 4. Language Theoretic Properties of Graph Extension Languages : An Investigation of Graph Extension Grammars with Context Matching and Logic

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

    Author : Yannick Stade; [2022]
    Keywords : graph language; formal language; theoretical computer science;

    Abstract : Graph extension grammars provide a way to define graph languages. They consist of a regular tree grammar and an algebra. The regular tree grammar generates trees, so-called derivation trees. Those are evaluated by the algebra into a set of graphs. READ MORE

  6. 5. An evaluation of .NET Object-Relational Mappers in relational databases : Entity Framework core and Dapper

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

    Author : Maximilian Myllyaho Forsberg; [2022]
    Keywords : ;

    Abstract : Object-Relational Mapping (ORM) is a method intended to counter the incompatibilities between Object-Oriented programming languages and relational databases. As of today ORM goes further then solving these incompatibilities and often provides a lot of features like tracking and caching data. READ MORE