Multiset Languages and Minimization Problem for Multiset Finite Automata
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F20%3A63526274" target="_blank" >RIV/70883521:28140/20:63526274 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Multiset Languages and Minimization Problem for Multiset Finite Automata
Original language description
Opening talk at international workshop LTA 2020 at the Faculty of Information Technology, Brno University of Technology. The aim of the talk was 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.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů