Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | Last revisionBoth sides next revision |
talks:seminar [2020/12/03 14:31] – krivka | talks:seminar [2020/12/04 10:28] – krivka |
---|
* 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ě) | * 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ě** | * **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 Automata and Their Minimization** | * **[[pmartinek@utb.cz|dr. Pavel Martinek]]: Multiset Languages and Minimization Problem for Multiset Finite Automata** |
* **Abstract**: | * **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. | * //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. |