LANGUAGE THEORY with APPLICATIONS 2016 (LTA 2016)

LTA 2016 is 6th 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 5 - 14, 2016

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

• Committee:
  • Alexander Meduna (chair)
  • Zbyněk Křivka
  • Ondřej Soukup
  • Jiří Kučera
  • Radim Kocman
  • Jakub Martiško

• Conference language: English

• Coverage:
  • LTA 2016 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 VYPe 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 VYPe 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: Radim Kocman and Zbyněk Křivka
• Abstract: PDF
• Presentation: Part One: Solved Questions and Part Two: New Models
• Date: December 5, 2016, 10:00 - 11:00
• Chair: Alexander Meduna
• Room: G202

The list of talks in VYPe and TID courses. The detailed schedule will be planned during November.

• Classroom: G202
• Chair: Jiří Kučera
• Talk duration: 12 minutes + discussion
• Level: MSc
• Talks:

11:00 - 12:15

• Brugvin Charlie, Vieira João A. T. B. P.: Tabular Parsing (Abstract)
• Jeleň Jakub, Ščešňák Vladimír: Parsing Techniques - Section 7.2 (Earley Parser) (Abstract)
• Bolješik Michal, Riša Martin: Parsing Techniques - Section 10.1 (Left-Corner Parsing) (Abstract)
• Gongol Jakub, Paulovčák Ján: Parsing Techniques - Section 15.2 (Two-Level Grammars) (Abstract)
• Bělehrádek Stanislav, Dvořáček Vojtěch: PEG Grammars and Packrat Parsing (Abstract)

12:15 - 13:00

• Domingues Diogo F. L. C. S., Vargovčík Pavol: Grammatical Inference and Learning (Abstract)
• Kubíček Martin, Stodůlka Petr: Advanced Techniques in Symbol Tables Implementation (Abstract)
• Kříž Vítězslav, Lamacz Jan: RGA - (LL) Scattered Context Grammars (Section 4.7) (Abstract)

• Classroom: C228
• Chair: Radim Kocman
• Talk duration: 25 minutes (including discussion)
• Level: PhD
• Talks:

11:00 - 12:15

• Jakub Budiský: The Pebble Game as a Computational Model (Abstract, Slides)
• Tomáš Fukač: Saving network traffic to dynamic memory (Abstract)
• Marta Čudová: Methods for Multiscale Models Coupling (Abstract)

12:20 - 13:35

• Michal Kekely: Analyzing sets of packet classification rules in order to optimize packet classification based on DCFL (Abstract)
• Radim Krčmář: On equivalence of linear #-rewriting systems and linear simple matrix grammars (Abstract)
• Jiří Skácel: Context-free grammars with additional conditions on symbol occurrence (Abstract)

• Classroom: G202
• Chair: Ondřej Soukup
• Talk duration: 12 minutes + discussion
• Level: MSc
• Talks:

10:00 - 11:15

• Hrdina Jan, Linares Rojas Jose Manuel: RGA - Semi-Conditional Grammars (Section 4.5 and 4.6) (Abstract)
• Gardáš Milan, Sedláčková Lucie: RGA - LL One-Sided Random Context Grammars (Section 6.5 and 6.7) (Abstract)
• Benda Tomáš, Pololáník Petr: RGA - Elimination of Erasing Rules (Chapter 7) (Abstract)
• Chudík Jakub, Šoustar Jakub: RGA - Controlled Pure Grammar Systems (Chapter 14) (Abstract)
• Havlena Vojtěch, Tomko Martin: RGA - Self-Regulating Automata (Chapter 15) (Abstract)

11:15 - 12:00

• Hanus Tomáš, Tutko Jakub: Optimizing Compilers - Chapter 6 (Creating Coarse-Grained Parallelism) (Abstract)
• Benna Filip, Bruckner Tomáš: Optimal Register Allocation in Polynomial Time (Abstract)
• Scherfel Walter, Slouka Lukáš: Compiler-Assisted Optimization (Abstract)

12:00 - 12:45

• Handlíř Jaroslav, Švestka Jakub: Optimizing Object-Oriented Programs (Abstract)
• Kopáček Jaroslav: Garbage Collection Algorithms I (Abstract)
• Absolon Marek, Pekař Tomáš: Garbage Collection Algorithms II (Abstract)

• Classroom: C228
• Chair: Jakub Martiško
• Talk duration: 25 minutes (including discussion)
• Level: PhD
• Talks:

11:00 - 12:15

• Jan Nevoral: Design of Polymorphic Gates Using Ambipolar Transistors (Abstract)
• Richard Pánek: Fault tolerant system - design of reconfigurable controller methodology (Abstract)
• Lukáš Hellebrandt: Statistical measures and attacks on anonymity networks (Abstract)

12:20 - 13:35

• Roman Vrána: Designing Hardware Acceleration using Dependency and Communication Graphs (Abstract)
• Daniel Daniš: Malware detection techniques using modern theoretical computer science (Abstract)
• Ondřej Hujňák: Vehicle Routing Problem and Its Relation to the Graph Theory (Abstract)

• LTA 2019
• LTA 2018
• LTA 2017

• LTA 2015
• LTA 2014
• LTA 2013
• LTA 2012
• LTA 2011