LANGUAGE THEORY with APPLICATIONS 2018 (LTA 2018)

LTA 2018 is 8th 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 3 - 13, 2018

• Organizers:
  1. the TID 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
  • Jakub Martiško
  • Radim Kocman
  • Dominika Regéciová

• Conference language: English

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

• Speakers: Alexander Meduna and Zbyněk Křivka
• Abstract: This talk will introduce jumping pure grammars, which are conceptualized just like classical pure grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings. We will compare the generative power of jumping pure grammars with that of classical pure grammars while distinguishing between their versions with and without erasing productions. Apart from sequential versions, we will present an analogical study in terms of parallel versions of jumping pure grammars represented by 0L grammars. During the talk, several open problems will be introduced to suggest the future investigation of jumping pure grammars.
• Date: December 12, 2018, 11:00 - 12:50
• Chair: Alexander Meduna
• Room: E112
• Materials: Slides (PDF), Handwritten notes with proofs explanations (PDF), Audio recording (WMA, 87 MB)

• Speaker: Alexander Meduna, FIT VUT, Brno
• Title: English: American Pronunciation (in Czech: O výslovnosti americké angličtiny)
• Note: Repeated performance/Pro velký zájem je přednáška opakována.
• 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.
• Date: December 3, 2018, 13:00 - 13:50
• Room: A112
• Materials: Slides (PDF), public audio-video recording from LTA 2017 (MP4, 298 MB)

• Title: Cestou amerických beatníků
• Date: December 13, 2018, 13:00 - 14:00
• Place: A112, FIT
• Reciter: Alexander Meduna
• Invitation (in Czech)
• For details, see Poetry Reading website

• Speaker: Vladimír Janoušek, FIT VUT, Brno
• Title: Rock'n'roll (in Czech)
• Abstract: Přednáška se metodou komentovaných videoukázek zabývá kořeny Rock'n'Rollu, okolnostmi jeho vzniku v padesátých letech, i tím, jak se uplatňuje jeho původní podoba v soudoubé kultuře.
• Date: December 13, 2018, 12:00 - 12:50
• Room: A112

The list of talks in VYPa and TID courses follows.

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

• Benkő Krisztián, Pavelka Martin: Elimination of Erasing Rules (Abstract)
• Bezák Adam, Matějíček Vojtěch: Tabular Parsing (Abstract)
• Klobučníková Dominika: Extensions of Parsing Algorithms Based on Normal Forms (Abstract)
• Bančák Michal, Vanek Roman: Grammatical Inference and Learning (Abstract)
• Andriushchenko Roman, Zanora Dmytro: Self-Regulating Automata (Abstract
• Hřebíček Pavel: Introduction into ANTLR v4 (Abstract)
• Costa William B., Rodrigues André O.: Object-Orientation - Advanced features (Abstract)

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

Invited short talk, 11:00-11:30:

• Radim Kocman: A Jumping 5'→3' Watson-Crick Finite Automata Model
  • Abstract: This talk introduces a combined model of jumping finite automata and sensing 5'→3' Watson-Crick finite automata. We will compare the accepting power of the new model with the original models and also with some well-known language families. We will also discuss changes in the accepting power when various restrictions are applied on the model.

Regular talks, 11:30 - 13:30:

• Kövári Adam: Efficient text indexing and search ( Abstract)
• Kukliš Filip: Runtime analysis of evolutionary algorithms ( Abstract)
• Orsák Michal: Optimization of packet classification for FPGA and off-chip memory ( Abstract)
• Tinka Jan: Formal Grammars in Recognition of Activities in Visual Data ( Abstract)

• Classroom: A112
• Chair: Dominika Regéciová
• Talk duration: 15 minutes (including discussion)
• Level: MSc
• Talks:

• Černý Lukáš, Michl Kamil: One-Sided Random Context Grammars (Abstract)
• Rous Petr, Valecký Dušan: Rewriting Over Word Monoids (Abstract)
• Bútora Matúš, Vosáhlo Daniel: Deterministic Set Automata (Abstract)
• Lach Martin, Navrátil Petr: Introduction to Compiler Design - Translating Structured Data (Abstract)
• Hornický Michal, Velecký Jan: Introduction to Compiler Design - Register Allocation (Abstract)
• Mores Martin: Optimal Register Allocation in Polynomial Time (Abstract)
• Dvořák Tomáš, Sikora Vít: Introduction to Compiler Design - Optimisations for Loops (Abstract)
• Racek Matyáš: Compilation on the web (Abstract)

• Classroom: A112
• Chair: Jakub Martiško
• Talk duration: 20 minutes (+ 5 minutes discussion)
• Level: PhD
• Talks:

• Regéciová Dominika: Tree Controlled Grammars ( Abstract)
• Tomko Martin: On Bridges in Transition Graphs for Finite Automata ( Abstract)

• LTA 2019

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