LANGUAGE THEORY with APPLICATIONS 2011 (LTA 2011)

LTA 2011 is a 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 13 - 15, 2011

• 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
  • Jiří Koutný
  • Martin Čermák

• Conference language: English

• Coverage:
  • LTA 2011 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 2011 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 giving 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 or payment.

• Questions: Contact Martin Čermak

• Audio-video recordings of sessions

• PDF Program Summarization (print version)

• Classroom: A112
• Chair: Jiří Koutný
• Talk duration: 20 minutes (including discussion)
• Level: PhD

• Kouřil Jan: Incremental construction of minimal finite automata and its utilization in natural language processing Abstract Slides
• Král Jiří: Using Alternating-Time Logic for modeling of artificial agents in wireless nets Abstract Slides
• Luža Radim: Processing and analysis of robotic arm control language Abstract Slides
• Matoušek Jiří: On complexity of offline partial dynamic reconfiguration Scheduling Abstract Slides
• Milička Martin: Tree edit distance in a document comparison Abstract Slides
• Minarovský Peter: A testing theory for real‐time systems Abstract Slides

• Classroom: A112
• Chair: Martin Čermák
• Talk duration: 20 minutes (including discussion).
• Level: PhD

• Bartoš Václav: Using support vector machines to classify multidimensional data Abstract Slides
• Volf Tomáš: Representing and quering moving objects Abstract Slides
• Petrlík Jiří: Multiobjective grammatically-based genetic programming Abstract Slides
• Sopuch Zbyněk: Parallel parsing based upon general multigenerative grammar systems Abstract Slides
• Šikulová Michaela: Cartesian genetic programming Abstract Slides
• Šimková Marcela: Assertion-based verification Abstract Slides
• Škoda Petr: Problems of CAP theorem proof and connection to PACELC taxonomy Abstract Slides
• Malčík Dominik: Model of a semiautomatic detection system Abstract Slides
• Vopěnka Václav: Automatic polynomial transformation of differential equations and derivation closure Abstract Slides

• Classroom: E105
• Chair: Zbyněk Křivka
• Talk duration: 10 minutes (including discussion).
• Level: MSc

• Hanák František, Kletzander Martin: LL(k) parsing I Abstract
• Lang Jozef, Bc., Zemko Zoltán: LL(k) parsing II Abstract
• Raiskup Pavel, Schiffer Peter: LR table construction Abstract
• Kučera Jiří, Raška Jiří: ANTLR: Parser generator Abstract

• Dlouhý Ivo, Preuss Jan: Lexical and syntactical structures in programming language Lua Abstract
• Beneš Vojtěch, Horčička Jakub: Lexical and syntactical structures in programming language Miranda Abstract
• Zajíc Jiří, Žouželka Martin: Lexical and syntactical structures in programming language Caml Abstract
• Hübner Lukáš, Vraštiak Pavel: Lexical and syntactical structures in programming language Ocaml Abstract

• Matička Jiří, Minář Michal: Code generation: intermediate languages Abstract
• Fraile Villalba Daniel: Symbol table Abstract
• Bučko Peter, Gajdušek Radek: Code generation: Symbol table Abstract
• Basovník Martin, Mareček Jakub: Optimization strategies Abstract
• Polách Ondřej, Soukup Ondřej: The effect of unrolling and inlining for python bytecode optimizations Abstract

• Divácký Roman, Utěkal Jan: Basic block scheduling & global code scheduling I Abstract
• Görig Jan, Ocelík Tomáš: Basic block scheduling & global code scheduling II Abstract
• Moltaš Jaroslav, Podhorský Jiří: Interprocedural Analysis: Basic concepts Abstract
• Randa Jakub, Šišák Ivan: Logical representation of data flow & simple pointer-analysis algorithm Abstract
• Hamada Ondřej, Hložánka Marek: Context-insensitive interprocedural analysis & context-sensitive pointer analysis Abstract