Some Notes to Minimization of 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%2F18%3A63520403" target="_blank" >RIV/70883521:28140/18:63520403 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1063/1.5044089" target="_blank" >http://dx.doi.org/10.1063/1.5044089</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1063/1.5044089" target="_blank" >10.1063/1.5044089</a>
Alternative languages
Result language
angličtina
Original language name
Some Notes to Minimization of Multiset Finite Automata
Original language description
The paper deals with minimization of multiset finite automata. It is shown that in case of deterministic multiset finite automata whose transitions satisfy certain conditions based on lexicographic ordering, the resulting minimal automaton is unique up to isomorphism. On the other hand, no such unique minimal automaton exists in case of nondeterministic multiset finite automata.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
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
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
AIP Conference Proceedings
ISBN
978-073541690-1
ISSN
0094-243X
e-ISSN
neuvedeno
Number of pages
4
Pages from-to
"nestrankovano"
Publisher name
American Institute of Physics Inc.
Place of publication
Maryland
Event location
Thessaloniki
Event date
Sep 25, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000445105400401