Table of Contents
Due to the decreasing interest in LTA workshops apart from the students of respective courses, we decided to cancel LTA 2024 and keep only internal seminars in the courses. If you are interested in the talks from Compiler Construction, Graph Algorithms, or Modern Theoretical Computer Science courses, let us know, and we can individually invite you (program schedule included).
LANGUAGE THEORY with APPLICATIONS 2023 (LTA 2023)
LTA 2023 is 13th student conference at the Faculty of Information Technology, Brno University of Technology.
Information
- Subject: Formal language theory and its applications in computer science
- Place: FIT BUT, Brno, Czech Republic
- Date: December 4 - 14, 2023
- Organizers:
- Formal Model Research Group, FIT BUT;
- Department of Information Systems, FIT BUT.
- Committee:
- Alexander Meduna (chair)
- Conference language: English, Czech
- Coverage:
- LTA 2023 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 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 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:
- demonstrating the TID, RGD, and VYPa student work in public;
- giving students the opportunity to present scientific talks in English;
- improving 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
Conference Schedule
Main Talk
- Hečko M.: Using Finite Automata to Decide First-Order Theory of Natural Numbers with Addition
- Abstract: Full abstract (PDF)
- The ability to algorithmically decide whether a given formula has a model is valuable to many areas of compiler construction and formal verification. It allows one to automatically prove that a given code optimization is sound to detect unintentional overflows and highlight other potential defects in a given program. Decision procedures are an active research area, and their implementations are being employed in the industry, e.g., to reason about the correctness of the configuration of critical infrastructure. This talk focuses on a decision procedure for the first-order theory of integers with addition (so-called Presburger arithmetic) based on the formal finite automata model. (to be continued in PDF)
- Schedule: Thursday, December 7, 2023, 13:00-13:30
- Chair: Alexander Meduna
SESSION 1 (on-line): Modern Theoretical Computer Science (Monday, December 4, 2023, 11:00-12:00, Google Meet)
- Meeting session: Google Meet (accessible for persons outside of BUT after an approval)
- Chair: Radek Burget
- Talk duration: 50 minutes for the presentation, 5 minutes for the discussion
- Level: PhD
- Regular talks:
- Hamza Salem: Web Information Extraction: An Algorithm for Detecting Main Content in News (Abstract)
SESSION 2 (on-site, room G202): Modern Theoretical Computer Science (Monday, December 11, 2023, 11:00-13:00)
- Classroom: G202
- Chair: Alexander Meduna
- Talk duration: 50 minutes for the presentation, 5 minutes for the discussion
- Level: PhD
- Regular talks:
- Havel Martin: How to Demonstrate Metalinearness by Tree-Restricted General Grammars (Abstract)
- Klembara Radovan: A Reduction of Scattered Context Grammars (Abstract)
SESSION 3 (on-site, room M104+M105): Compiler Construction (Thursday, December 14, 2023, 11:00-14:30)
The list of talks from VYPa course follows.
- Chair: Zbyněk Křivka
- Talk duration: 6+6 minutes for presentation, 1-3 minutes for the discussion
- Level: MSc
- Early regular talk: (Thursday, December 7, 2023, 13:30-13:45)
- Regular talks: (Thursday, December 14, 2023, 11:00-14:15)
- Luis Vila, Tessa Luaces De Fazio: Parallel and Distributed Parsing: A Practical Viewpoint (Abstract)
- Barbora Šmahlíková, Timotej Ponek: Travatar: A Forest-to-String Machine Translation Engine based on Tree Transducers (Abstract)
- Thomas Martin: Dynamic Libraries (Abstract)
- Guilherme Franco, Pavlo Vilkhovyi: A study on the Relationship between language Interpretation and Automata theory based on the paper “Syntactic analysis employing automata theory” (Abstract)