On a generalized form of multiset finite automata with suppressed nonfinal states
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F22%3A63551318" target="_blank" >RIV/70883521:28140/22:63551318 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1063/5.0081904" target="_blank" >http://dx.doi.org/10.1063/5.0081904</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1063/5.0081904" target="_blank" >10.1063/5.0081904</a>
Alternative languages
Result language
angličtina
Original language name
On a generalized form of multiset finite automata with suppressed nonfinal states
Original language description
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.
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
2022
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-0-7354-4182-8
ISSN
0094-243X
e-ISSN
—
Number of pages
4
Pages from-to
—
Publisher name
American Institute of Physics Inc.
Place of publication
Maryland
Event location
Rodos
Event date
Sep 17, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—