Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Pavel Martinek"'
Publikováno v:
International Journal of Production Economics. 257:108754
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::18bb0589a4acb60a39d7e1850e0fd755
https://doi.org/10.1016/j.ijpe.2022.108754
https://doi.org/10.1016/j.ijpe.2022.108754
Autor:
Pavel Martinek
Publikováno v:
Soft Computing
Fuzzy multiset finite automata with output represent fuzzy version of finite automata (with output) working over multisets. This paper introduces Mealy-like, Moore-like, and compact fuzzy multiset finite automata. Their mutual transformations are des
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bfc610f64e7bc179f6d965e7fef92017
http://publikace.k.utb.cz/handle/10563/1011170
http://publikace.k.utb.cz/handle/10563/1011170
Autor:
Pavel Martinek
Publikováno v:
INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS ICNAAM 2020.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::32ec1933102f51afd063bcb6f0e8767e
https://doi.org/10.1063/5.0081904
https://doi.org/10.1063/5.0081904
Autor:
Pavel Martinek
Publikováno v:
Fuzzy Sets and Systems. 301:116-128
In classical formal language theory there is a well-known result stating equality between context-free and adult 0L languages, the first ones being generated in a sequential way whilst the second ones are generated in a parallel way. This paper gener
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be1915912b157422dcc4970b32a2b5ea
https://doi.org/10.1016/j.fss.2015.12.001
https://doi.org/10.1016/j.fss.2015.12.001
Autor:
Pavel Martinek
Publikováno v:
SCIS&ISIS
Fuzzy multiset regular languages are languages generated by fuzzy multiset regular grammars or (alternatively) accepted by fuzzy multiset finite automata. Family of fuzzy multiset regular languages is known to be closed under regular operations. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a4c4d3aae7bdbd59a3c5273b96e65899
https://doi.org/10.1109/scis-isis.2018.00102
https://doi.org/10.1109/scis-isis.2018.00102
Autor:
Pavel Martinek
Publikováno v:
AIP Conference Proceedings.
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddb17c62f66db0233a5ca6a849fff9ac
https://doi.org/10.1063/1.5044089
https://doi.org/10.1063/1.5044089
Autor:
Pavel Martinek
Publikováno v:
AIP Conference Proceedings.
The class of multiset languages accepted by deterministic multiset finite automata with detection is strictly included in the class of multiset regular languages. Since multiset regular languages coincide with semilinear languages, the strict inclusi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05b23d03f42fc396f7336d6daaca7e10
https://doi.org/10.1063/1.4992717
https://doi.org/10.1063/1.4992717
Autor:
Pavel Martinek
Publikováno v:
Fuzzy Sets and Systems. 166:44-55
A relationship between L-order based on an L-equality and L-order based on crisp equality is explored in detail. This enables to clarify some properties of completely lattice L-ordered sets and generalize some related assertions. Namely, Belohlavek's
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::adf1ce1335bf5d54f1c312e17c2222fb
https://doi.org/10.1016/j.fss.2010.11.003
https://doi.org/10.1016/j.fss.2010.11.003
Autor:
Pavel Martinek
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783319336237
CSOC (1)
CSOC (1)
Fuzzy multiset finite automata represent fuzzy version of finite automata working over multisets. Description of these automata can be simplified to such a form where transition relation is bivalent and only the final states form a fuzzy set. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c4423acbad18100ec3177a1c770f7e3
https://doi.org/10.1007/978-3-319-33625-1_42
https://doi.org/10.1007/978-3-319-33625-1_42
Autor:
Pavel Martinek
Publikováno v:
FSKD
The concept of fuzzy multiset finite automata was introduced recently by Wang et al. in [14]. The idea is elaborated towards deterministic fuzzy multiset finite automata and the corresponding languages. The languages are studied with respect to some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d3eaa37abbe0db3fd20b2d49842845c
https://doi.org/10.1109/fskd.2015.7381915
https://doi.org/10.1109/fskd.2015.7381915