On a generalized form of multiset finite automata with suppressed nonfinal states

Martinek, Pavel

dc.title	On a generalized form of multiset finite automata with suppressed nonfinal states	en
dc.contributor.author	Martinek, Pavel
dc.relation.ispartof	AIP Conference Proceedings
dc.identifier.issn	0094-243X Scopus Sources, Sherpa/RoMEO, JCR
dc.identifier.isbn	978-0-7354-4182-8
dc.date.issued	2022
utb.relation.volume	2425
dc.event.title	International Conference on Numerical Analysis and Applied Mathematics 2020, ICNAAM 2020
dc.event.location	Rhodos
utb.event.state-en	Greece
utb.event.state-cs	Řecko
dc.event.sdate	2020-09-17
dc.event.edate	2020-09-23
dc.type	conferenceObject
dc.language.iso	en
dc.publisher	American Institute of Physics Inc.
dc.identifier.doi	10.1063/5.0081904
dc.relation.uri	https://aip.scitation.org/doi/abs/10.1063/5.0081904
dc.description.abstract	The paper presents a generalized form of multiset finite automata. An important feature of the form is that all or almost all of its states are final. This leads to a new description of semilinear languages (which correspond to languages accepted by multiset finite automata) and can be used as a suitable tool for solving various problems from formal multiset languages theory. © 2022 American Institute of Physics Inc.. All rights reserved.	en
utb.faculty	Faculty of Applied Informatics
dc.identifier.uri	http://hdl.handle.net/10563/1010955
utb.identifier.obdid	43883730
utb.identifier.scopus	2-s2.0-85128541665
utb.source	d-scopus
dc.date.accessioned	2022-05-05T12:14:40Z
dc.date.available	2022-05-05T12:14:40Z
utb.ou	Department of Mathematics
utb.contributor.internalauthor	Martinek, Pavel
utb.fulltext.dates	Published Online: 06 April 2022
utb.scopus.affiliation	Martinek P., Department of Mathematics, Tomas Bata University in Zlín, nám. T. G. Masaryka 5555, Zlín, 760 01, Czech Republic