LANGUAGE THEORY with APPLICATIONS 2019 (LTA 2019)

LTA 2019 is 9th student conference at the Faculty of Information Technology, Brno University of Technology.

• Subject: Formal language theory and its applications in computer science
• Place: FIT BUT, Brno, Czech Republic
• Date: December 9 - 18, 2019 + Opening Talks on 18th November and 2nd December

• 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
  • Radim Kocman
  • Dominika Klobučníková
  • Tomáš Dvořák

• Conference language: English, Czech

• Coverage:
  • LTA 2019 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

• Acknowledgement: This conference is partially supported by TAČR grant Visual Computing Competence Center (V3C), TE01020415.

• Speaker: prof. Lakshmanan Kuppusamy, School of Computer Science & Engineering, Department of Computational BioSciences, VIT University, India
  • For list of recent publications, see DBLP.
• Abstract: PDF version.
• Date: Monday, November 18, 2019, 15:00 - 16:00
• Chair: Alexander Meduna
• Room: G202
• Materials: Slides (PDF), Videorecording (HD, MP4, 1.3 GB)

Due to organizing purpose, we had to change the date, time and room of this lecture! It will be on Monday, December 2 at 11:00 in lecture room A112.

• Speaker: prof. Lakshmanan Kuppusamy, School of Computer Science & Engineering, Department of Computational BioSciences, VIT University, India
  • For list of recent publications, see DBLP.
• Abstract: PDF version.
• Date: Monday, December 2, 2019, 11:00 - 12:30
• Chair: Alexander Meduna
• Room: A112
• Materials: Slides (PDF), Videorecording (HD, MP4, 2.7 GB)

• Wednesday, December 11, 2019, room E112
  • 13:00 - 13:45 Discussion: Alexander Meduna: American vs. European Students (in Czech)

• Speaker: Alexander Meduna, FIT VUT, Brno
• Title: Rozhovor s Dylanem
• Abstract (in Czech): Přednáška komentuje překvapivý rozhovor Boba Dylana, který poskytl pro pořad 60 minutes dne 12. 5. 2004.
• Date: December 16, 2019, 12:00 - 12:50
• Room: A112

• Speaker: Radim Kocman
• Abstract:
  • In formal language theory, when we study new models, we often want to know whether a certain language can be defined by the model in question. To show that it is possible, we can simply construct an appropriate instance of such a model. However, to show that it is not possible, we have to rigorously prove that no such an instance can exist. If we want to show that a language cannot be defined by the given model and we work with regular or context-free languages, we can use pumping lemmas which are specifically constructed for this task.
  • Nonetheless, when we work with jumping models, it is usually not possible to easily derive such a lemma. Luckily for us, we can usually exploit the fact that jumping models cannot sufficiently control the order of symbols and show that if the model defines some word in the language it also has to define some word that is not in the language. However, in the newly introduced jumping 5'→3' Watson-Crick finite automata this previous approach can no longer be effectively used since the model can easily keep the precise order of symbols for all linear languages.
  • In this talk, we introduce a new concept of the debt of the configuration of the automaton and show how it can be used to prove that a language cannot be defined by the given jumping model.
• Date: December 18, 2019, 11:00 - 12:10
• Chair: Zbyněk Křivka
• Room: E112
• Materials: Handouts (PDF), Presentation (PDF)

• Speaker: Vladimír Janoušek, FIT VUT, Brno
• Title: Jerry Lee Levis (in Czech)
• Abstract: Přednáška se metodou komentovaných videoukázek zabývá historií rock'n'rollu.
• Date: December 18, 2019, 12:10 - 13:00
• Room: E112

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

• Classroom: A112
• Chair: Zbyněk Křivka
• Talk duration: 15 minutes (including discussion)
• Level: MSc

• Invited talk, 11:00-11:45:
  • Alexander Meduna: American Pronunciation (in Czech)
    • Abstract (in Czech): Výslovnost americké angličtiny obsahuje některé zvuky, které Čech imituje chybně. Učitelé, včetně rodilých mluvčích, tyto odchylky zpravidla tolerují a spokojí se s touto nesprávně provedenou imitací, pokud je alespoň trochu srozumitelná. Prezentovaná přednáška naopak na tyto zvuky explicitně upozorní a načrtne, jak je vysloví Američan. Prezentace bude mít neformální charakter.

• Regular talks, 11:50 - 13:50:
  • Neužil Antonín, Sabela David: Optimization in Dynamic Language Runtimes (Abstract)
  • Aubrecht Tomáš, Kotráš Jan: Just-in-Time Compiler Optimzation (Abstract)
  • Karlík Pavol, Jančová Markéta: Functional programming - Tail Call Optimization (Abstract)
  • Mendes José Pedro B., Cebrian Garcia Ricardo: Comparison of Template Metaprogramming and Functional Programming (Abstract)
  • Horký Michal, Múčka Matúš: Object-Orientation - Compilation of Multiple inheritance (Abstract)
  • Kozák David, Labás Dominik: Hindley-Milner Type System and Modern Type Systems (Abstract)

• Classroom: E105
• Chair: Alexander Meduna
• Talk duration: 20 minutes (+ 5 minutes discussion)
• Level: PhD

Presentations:

• Tomko Martin: Commutative Grammars and Permutation Grammars (Abstract, Presentation)
• Klobučníková Dominika: On the Relation Between Right-Linear #-Rewriting Systems and Simple Matrix Grammars (Abstract, Presentation)
• Tomko Martin: Multi-Island Finite Automata and Their Even Computation (Abstract, Presentation)

• Classroom: E105
• Chair: Alexander Meduna
• Talk duration: 20 minutes (+ 5 minutes discussion)
• Level: PhD

Presentations:

• Hodaň David: Planar Graphs (Abstract, Presentation)
• Beníčková Zuzana: Uniform Regulated Rewriting in Parallel (Abstract, Presentation)
• Klobučníková Dominika: #-Rewriting Systems in Relation to Simple Matrix Grammars ( Abstract, Presentation)

• Beníčková Zuzana: Parallel Rewriting Over Word Monoids (Abstract, Presentation, RGD Talk)

• Classroom: A112
• Chair: Tomáš Dvořák
• Talk duration: 15 minutes (including discussion)
• Level: MSc

• Regular Talks, 11:00-11:50 (approx. 3-4 students):
  • Beránek Michal, Polách Radim: Object-oriented Type Systems (Abstract)
  • Mutňanský Filip, Klembara Filip: Context free grammars with storage (Abstract)
  • Cátia Queirós, Nuno Carneiro: Digital Images and Formal Languages (Abstract)
  • Hammer Jan: Applications of Scattered Context Grammars (Abstract)
  • Ambrož Vít, Bednařík David: Visibly Pushdown Transducers (Abstract)
• Cultural talk, 12:00-12:50:
  • Alexander Meduna: Rozhovor s Dylanem (in Czech)
• Presentations of Countries by Foreign Students, 13:00-13:40:
  • Cátia Queirós, José Pedro Mendes, Nuno Carneiro: Portugal (Abstract)

• Classroom: E112
• Chair: Zbyněk Křivka
• Room:
  • 11:00 - 12:10 Scientific Lecture: Radim Kocman: On Proof Techniques in Jumping Models (in Czech)
    • For abstract, see above.
  • 12:10 - 13:00 Cultural Talk: Vladimír Janoušek: Jerry Lee Levis (Rock'n'Roll) (in Czech)
    • For short abstract, see above.

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