LANGUAGE THEORY with APPLICATIONS 2013 (LTA 2013)

LTA 2013 is 3rd student conference at the Faculty of Information Technology, Brno University of Technology.

Information

Language Theory with Applications 2013 (Logo)

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

Committee:
- Alexander Meduna (chair)
- Zbyněk Křivka
- Petr Zemek
- Lukáš Vrábel
- Petr Horáček
- Ondřej Soukup
- Jiří Kučera
- Ondřej Navrátil

Coverage:
- LTA 2013 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 2012 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, VYPe, and GAL 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.

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

Talks:
- 09:00 - 10:20 Main talk
  - Meduna Alexander, Zemek Petr: Regulated Grammars and Automata (Abstract)
Talks (Theory):
- 10:20 - 10:40 Kučera Jiří: On State-Synchronized Automata Systems (Abstract)
- 10:40 - 11:00 Soukup Ondřej: Alternative Modes of Scattered Context Derivations (Abstract)
- 11:00 - 11:20 Chaloupka Jan: Transformation of Ordinary Differential Equations Into an Equivalent Polynomial Form (Abstract)
- 11:20 - 11:40 Youssef Sawsan: Parse Tree in Context-Free Parallel Communicating Grammar Systems (Abstract)
- 11:40 - 12:00 Navrátil Ondřej: Translation State Systems With a Limited Distribution (Abstract)
Talks (Type Systems, Visualization and Geometry):
- 12:00 - 12:20 Matula Peter: Type Systems, Their Models and Usage in Decompilation (Abstract)
- 12:20 - 12:40 Snášelová Petra: Fractals and L-systems (Abstract)
- 12:40 - 13:00 Zajíc Jiří: Optimization of Hyperbolic Tree Layout (Abstract)

Talks (Digital Systems, Parallelism, Verification):
- 09:00 - 09:20 Crha Adam: SAT-Based Equivalence Checking of Polymorphic Circuits (Abstract)
- 09:20 - 09:40 Zamba Martin: Functional Equivalence of Combinatorial Logic Networks (Abstract)
- 09:40 - 10:00 Tesař Radek: Synthesis of Polymorphic Digital Circuits (Abstract)
- 10:00 - 10:20 Hrbáček Radek: Approximate Computing (Abstract)
- 10:20 - 10:40 Podivínský Jakub: Dependability Models (Abstract)
- 10:40 - 11:00 Čekan Ondřej: Coverage Directed Constraint Random Test Generation and Constraint Satisfaction Problem (Abstract)
- 11:00 - 11:20 Smolík Jakub: Formal View on Agents and Multi-Agent Systems (Abstract)
- 11:20 - 11:40 Záň Drahoslav: A Formal Model For Real-Time Parallel Computation (Abstract)
Talks (Security):
- 11:40 - 12:00 Koranda Karel: Formal Analysis of Cryptographic Protocols (Abstract)
- 12:00 - 12:20 Belal Alkomiet: Variable-Length Codes and Finite Automata (Abstract)
- 12:20 - 12:40 Aron Lukáš: Access Control Models on Mobile Devices (Abstract)
- 12:40 - 13:00 Ovšonka Daniel: Malware Detection Using Context-Free Grammars (Abstract)