| Both sides previous revisionPrevious revisionNext revision | Previous revision |
| talks:seminar [2019/11/22 07:50] – krivka | talks:seminar [2022/12/01 23:38] (current) – krivka |
|---|
| ===== Program semináře ===== | ===== Program semináře ===== |
| |
| | ==== 2022 ==== |
| | * **5. - 15. 12. 2022: [[http://www.fit.vutbr.cz/~meduna/work/doku.php?id=lectures:lta:lta22|LANGUAGE THEORY with APPLICATIONS 2022]] (LTA 2022) - studentský workshop** |
| | * Podrobný program - [[http://www.fit.vutbr.cz/~meduna/work/doku.php?id=lectures:lta:lta22#conference_schedule|zde]] (přednášky vedeny v angličtině) |
| | * **5. 12. 2022, 11:00 - 13:20, A112, FIT VUT v Brně** |
| | * **[[itomko@fit.vut.cz|Ing. Martin Tomko]]: Multi-Island Finite Automata and Their Even Computation** |
| | * **[[kocman@fit.vut.cz|Ing. Radim Kocman, PhD.]]: Advanced LL parsing techniques** |
| | * Abstrakty a detaily rozvrhu přednášek dostupné na stránce [[:lectures:lta:lta22|LTA 2022]]. |
| | |
| | |
| | ==== 2020 ==== |
| | * **10. - 15. 12. 2020: [[http://www.fit.vutbr.cz/~meduna/work/doku.php?id=lectures:lta:lta20|LANGUAGE THEORY with APPLICATIONS 2020]] (LTA 2020) - studentský workshop (on-line)** |
| | * Podrobný program - [[http://www.fit.vutbr.cz/~meduna/work/doku.php?id=lectures:lta:lta20#conference_schedule|zde]] (přednášky vedeny v angličtině) |
| | * **10. 12. 2020, 12:00 - 13:30, [[https://teams.microsoft.com/l/meetup-join/19%3ameeting_ZjEzZmE4MjgtZDExNi00NjUxLWIxMGMtMzlkODcwNTY0NTIw%40thread.v2/0?context=%7b%22Tid%22%3a%22c63ce729-ca17-4e52-aa2d-96b79489a542%22%2c%22Oid%22%3a%22b0c92057-f3f8-43f5-995e-a5cec0b35bfe%22%7d|On-line přes MS Teams]], FIT VUT v Brně** |
| | * **[[pmartinek@utb.cz|dr. Pavel Martinek]]: Multiset Languages and Minimization Problem for Multiset Finite Automata** |
| | * **Abstract**: |
| | * //Multisets// (also called //bags//) represent such a generalization of sets which allow multiplied occurrence of their elements. Finite automata working over multisets differ from usual finite automata in the way how they process their input. Namely, at each computational step, they read a symbol from their input multiset regardless of any ordering of the input. Thus, instead of processing strings of symbols the automata process multisets of symbols. This formalism was already used in defining computational models inspired from biochemistry (like the chemical abstract machine by Berry and Boudol, 1992) or biology (cf. well-known P systems). It has also strong connections to jumping automata introduced by Meduna and Zemek in 2012. |
| | * The aim of the talk is to describe the concept of multiset automata and their place in formal languages theory, to show their similarities and dissimilarities with classical and jumping finite automata and to deal with minimization of these automata. |
| |
| ==== 2019 ==== | ==== 2019 ==== |
| * It is well known that the set of context-free languages is a strict subset of the set of recursively enumerable languages. Analogously, a type-2 (or context-free) grammar cannot simulate a type-0 grammars. However, if we control or regulate the application of the context-free rules, then we can make the grammar to simulate a type-0 grammar. Several regulations are associated with these grammars and are called regulated rewriting grammars. Some of them are (i) Matrix rewriting grammars (ii) Graph-Controlled grammars (iii) Semi-Conditional grammars. The descriptional complexity investigates the economical measures required for a grammatical device, automaton, or a rewriting system for a succinct representation of a formal language class. | * It is well known that the set of context-free languages is a strict subset of the set of recursively enumerable languages. Analogously, a type-2 (or context-free) grammar cannot simulate a type-0 grammars. However, if we control or regulate the application of the context-free rules, then we can make the grammar to simulate a type-0 grammar. Several regulations are associated with these grammars and are called regulated rewriting grammars. Some of them are (i) Matrix rewriting grammars (ii) Graph-Controlled grammars (iii) Semi-Conditional grammars. The descriptional complexity investigates the economical measures required for a grammatical device, automaton, or a rewriting system for a succinct representation of a formal language class. |
| * In this talk, we are going to concentrate on semi-conditional grammars and their variants simple semi-conditional and generalized forbidden grammars. In a semi-conditional grammar, the derivations are controlled by permitting string and/or forbidden string that are associated with each rule and is known as conditional rule. The maximum lengths of permitting strings of permitting and forbidden strings refer to the degree of the system. Besides degree, the number of nonterminals and the number of conditional rules are considered to be descriptional complexity measures. We will see the computational completeness results of the above said systems with minimal/succinct sizes of measures. Our proofs include some novel ideas and effective use of Geffert normal forms. In the sequel, we will review some results available in the literature; many of the results are contributed by Prof. Alexander Meduna and his research group. | * In this talk, we are going to concentrate on semi-conditional grammars and their variants simple semi-conditional and generalized forbidden grammars. In a semi-conditional grammar, the derivations are controlled by permitting string and/or forbidden string that are associated with each rule and is known as conditional rule. The maximum lengths of permitting strings of permitting and forbidden strings refer to the degree of the system. Besides degree, the number of nonterminals and the number of conditional rules are considered to be descriptional complexity measures. We will see the computational completeness results of the above said systems with minimal/succinct sizes of measures. Our proofs include some novel ideas and effective use of Geffert normal forms. In the sequel, we will review some results available in the literature; many of the results are contributed by Prof. Alexander Meduna and his research group. |
| * **ZMĚNA** :!: :!: :!: **2. 12. 2019, 11:00 - 12:30, [[http://www.fit.vutbr.cz/FIT/map/fit1.php?show=A112|přednášková místnost A112]], FIT VUT, Božetěchova 2, Brno** | * **2. 12. 2019, 11:00 - 12:30, [[http://www.fit.vutbr.cz/FIT/map/fit1.php?show=A112|přednášková místnost A112]], FIT VUT, Božetěchova 2, Brno** |
| * **[[lakshma@vit.ac.in|Lakshmanan Kuppusamy]]: Descriptional Complexity of Matrix and Graph-Controlled Insertion-Deletion Systems** | * **[[lakshma@vit.ac.in|Lakshmanan Kuppusamy]]: Descriptional Complexity of Matrix and Graph-Controlled Insertion-Deletion Systems** |
| * **Abstract**: | * **Abstract**: |
