LANGUAGE THEORY with APPLICATIONS 2020 (LTA 2020)

LTA 2020 is 10th student workshop at the Faculty of Information Technology, Brno University of Technology. According to the epidemiology situation, the talks will be presented on-line using Microsoft Teams platform.

• Subject: Formal language theory and its applications in computer science
• Place: FIT BUT, Brno, Czech Republic
• Date: December 10 - 15, 2020

• Organizers:
  1. the TID, RGD and VYPa teaching teams;
  2. Formal Model Research Group, FIT BUT;
  3. Department of Information Systems, FIT BUT.

• Committee:
  • Alexander Meduna (chair)
  • Zbyněk Křivka
  • Dominika Klobučníková
  • Tomáš Dvořák

• Conference language: English, Czech

• Coverage:
  • LTA 2020 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 a 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.

• Questions: Contact Zbyněk Křivka

• Speaker: dr. Pavel Martinek, Faculty of Applied Informatics, Tomáš Baťa University in Zlín, Czech republic
  • For a list of recent publications, see DBLP.
• Date: Thursday, December 10, 2020, 12:00 - 13:30
• Place: on-line using Microsoft Teams scheduled meeting
• Title: Multiset Languages and Minimization Problem for Multiset Finite Automata
• Abstract: Multisets (also called bags) represent such a generalization of sets which allow multiplied occurrence of their elements. Finite automata working over multisets differ from usual finite automata in the way how they process their input. Namely, at each computational step, they read a symbol from their input multiset regardless of any ordering of the input. Thus, instead of processing strings of symbols the automata process multisets of symbols. This formalism was already used in defining computational models inspired from biochemistry (like the chemical abstract machine by Berry and Boudol, 1992) or biology (cf. well-known P systems). It has also strong connections to jumping automata introduced by Meduna and Zemek in 2012.
  • The aim of the talk is to describe the concept of multiset automata and their place in formal languages theory, to show their similarities and dissimilarities with classical and jumping finite automata and to deal with minimization of these automata.
• Chair: Alexander Meduna
• Slides: PDF
• Videorecording: Microsoft Stream link (if you do not have access, please let me know your email)

The list of talks in VYPa, RGD, and TID courses follows.

• Place: on-line using MS Teams
• Chair: Zbyněk Křivka
• Talk duration: 10-15 minutes

• Short introduction of my home country and culture:
  • Kholjuraev Muslimjon: Uzbekistan
  • Goncharenko Kristina: Russia (The Republic of Buryatia)

• Place: on-line using MS Teams
• Chair: Zbyněk Křivka
• Talk duration: 20 minutes (including discussion)
• Level: MSc

Regular talks, 11:00 - 13:20:

• Dlouhá Simona, Galvano Giancarlo Maria: Transducers and Grammars as Theories of Language (abstract)
• Mazza Francescogabriele, Musotto Daniela: Tree Transducers (abstract)
• Muslimjon Kholjuraev: Parsing for Indentation-sensitive Languages (TBA: abstract)
• Holko Maroš, Kožár Tomáš: Object-oriented Compiler Design (abstract)
• Ren ZhiDong: Compiler Design - Sections 4.1 - 4.4 (Logic Programming Languages)
• Choi Jung In, Viggiano Franco Nicola: Linkers and Loaders (abstract)
• Goncharenko Kristina, Yatsenko Kateryna: Reverse Engineering (abstract)
• Kubov Peter, Mička Richard: Reverse Engineering of Object Oriented Code (abstract)

Presentation from RGD (13:20-13:45, rescheduled from Session 2, PhD level):

• Malaník Petr: Jumping Finite Automata: Application in Embedded systems (abstract)

• Place: on-line using MS Teams
• Chair: Alexander Meduna
• Talk duration: 20 minutes (+ 5 minutes discussion)
• Level: PhD

Presentations from RGD:

• Januš Filip: Rewriting Over Word Monoids (abstract)

Presentation from TID:

• Ozden Ahmet Yarkin: The Role of Finite State Machines in Blockchain Smart Contracts (abstract)

• LTA 2019
• LTA 2018
• LTA 2017
• LTA 2016
• LTA 2015
• LTA 2014
• LTA 2013
• LTA 2012
• LTA 2011