Kontaktujte nás | Jazyk: čeština English
Název: | On a generalized form of multiset finite automata with suppressed nonfinal states | ||||||||||
Autor: | Martinek, Pavel | ||||||||||
Typ dokumentu: | Článek ve sborníku (English) | ||||||||||
Zdrojový dok.: | AIP Conference Proceedings. 2022, vol. 2425 | ||||||||||
ISSN: | 0094-243X (Sherpa/RoMEO, JCR) | ||||||||||
Journal Impact
This chart shows the development of journal-level impact metrics in time
|
|||||||||||
ISBN: | 978-0-7354-4182-8 | ||||||||||
DOI: | https://doi.org/10.1063/5.0081904 | ||||||||||
Abstrakt: | 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. | ||||||||||
Plný text: | https://aip.scitation.org/doi/abs/10.1063/5.0081904 | ||||||||||
Zobrazit celý záznam |
Soubory | Velikost | Formát | Zobrazit |
---|---|---|---|
K tomuto záznamu nejsou připojeny žádné soubory. |