LTA 2022 is 12th student conference at the Faculty of Information Technology, Brno University of Technology.


Language Theory with Applications 2022 (Logo)

  • Subject: Formal language theory and its applications in computer science
  • Place: FIT BUT, Brno, Czech Republic
  • Date: December 12 - 15, 2022
  • Conference language: English, Czech
  • Coverage:
    • LTA 2022 offers a variety of scientific talks on formal language theory and its computer-related applications at MSc and PhD levels. A special attention is paid to modern applications related to the language translation. Most of the talks results from the students' work in the TID, RGD and VYPa classes taught at FIT BUT.
  • Style:
    • Talks are presented so they clearly and quickly explain their significance to today's computer science. As a result, in some instances, results and their proofs may be merely outlined in an informal way. LTA does not tolerate presentations that hide their shallow contents behind exotic pictures.
  • Purpose: The purpose of this event is three-fold:
    1. demonstrating the TID, RGD, and VYPa student work in public;
    2. giving students the opportunity of presenting scientific talks in English;
    3. improving communication between students and teachers interested in the subject of the conference.
  • Audience: Everybody is welcome to attend this event without any prior notice. There is no payment.

Opening Talks

Martin Tomko: Multi-Island Finite Automata and Their Even Computation

Radim Kocman: Advanced LL parsing techniques

  • Speaker: dr. Radim Kocman, FIT VUT, Brno
  • Abstract: LL parsing is usually one of the first techniques of syntactic analysis introduced during the basic study of compilers and formal languages. However, advanced courses often switch their attention solely to LR parsing and its variants, such as LALR and SLR parsing. The focus of this presentation is on advanced LL parsing techniques that push further the initial LL idea. These advanced techniques introduce some new beneficial properties for syntactic analysis and increase the power of the resulting parser to handle more complex constructions of programming languages. We will talk about full LL(1) parsing, general LL(k) parsing, and modified LL(k) parsing for an automaton with a one-symbol reading head.
  • Date: Monday, December 5, 2022, 12:30 - 13:20
  • Room: A112
  • Slides: PDF version.

Conference Schedule

SESSION 1: Compiler Construction (Monday, December 12, 2022, 11:00-13:50, A112)

The list of talks from VYPa course follows.

  • Classroom: A112
  • Talk duration: 6+6 minutes for presentation, 1-3 minutes for the discussion
  • Level: MSc

SESSION 2: Modern Theoretical Computer Science (Thursday, December 15, 2022, 11:00-13:50, E105)

The list of talks from TID course follows.

  • Classroom: E105
  • Talk duration: 40 minutes for the presentation, 5 minutes for the discussion
  • Level: PhD

Conference history

lectures/lta/lta22.txt · Last modified: 2022/12/12 17:30 by xhavel44
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Noncommercial-Share Alike 4.0 International
Recent changes RSS feed Donate Powered by PHP Valid XHTML 1.0 Valid CSS Driven by DokuWiki