Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Marek Szykuła"'
Autor:
John Wittnebel, Marek Szykuła
Publikováno v:
Theoretical Computer Science. 787:45-76
We study the properties of syntactic monoids of bifix-free regular languages. In particular, we solve an open problem concerning syntactic complexity: We prove that the cardinality of the syntactic semigroup of a bifix-free language with state comple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a248de1d2c4d012e297f8ff75f08c86a
https://doi.org/10.1016/j.tcs.2018.12.025
https://doi.org/10.1016/j.tcs.2018.12.025
Autor:
Marek Szykuła, Robert Ferens
Publikováno v:
Theoretical Computer Science. 787:14-27
We study descriptive complexity properties of the class of regular bifix-free languages, which is the intersection of prefix-free and suffix-free regular languages. We show that there exist universal bifix-free languages that meet all the bounds for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7528d4109d6cde3ec101001a1db594e
https://doi.org/10.1016/j.tcs.2018.09.016
https://doi.org/10.1016/j.tcs.2018.09.016
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 33:1699-1706
We propose a new General Game Playing (GGP) language called Regular Boardgames (RBG), which is based on the theory of regular languages. The objective of RBG is to join key properties as expressiveness, efficiency, and naturalness of the description
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9782fbfd06f40e82733533aeaf20d89
https://doi.org/10.1609/aaai.v33i01.33011699
https://doi.org/10.1609/aaai.v33i01.33011699
Autor:
Radoslaw Miernik, Marek Szykuła, Maksymilian Mika, Wojciech Pawlik, Andrzej Tkaczyk, Jakub Sutowicz, Jakub Kowalski
Publikováno v:
CoG
We present the technical side of reasoning in Regular Boardgames (RBG) language -- a universal General Game Playing (GGP) formalism for the class of finite deterministic games with perfect information, encoding rules in the form of regular expression
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9a869440fe1a5d330b9d789f1e26d90
Autor:
Marek Szykuła, Janusz A. Brzozowski
Publikováno v:
Information and Computation. 259:174-190
The final publication is available at Elsevier via http://dx.doi.org/10.1016/j.ic.2017.08.014 © 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a69e55883e4983c850260a31f3e0177a
https://doi.org/10.1016/j.ic.2017.08.014
https://doi.org/10.1016/j.ic.2017.08.014
Autor:
Janusz A. Brzozowski, Marek Szykuła
Publikováno v:
FCT
A sequence \((L_k,L_{k+1} \dots )\) of regular languages in some class \({\mathcal C}\), where n is the state complexity of \(L_n\), is called a stream. A stream is most complex in class \({\mathcal C}\) if its languages together with their dialects
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42acbc3c5e6be9c016e37e099064b3b1
https://doi.org/10.1016/j.jcss.2017.05.011
https://doi.org/10.1016/j.jcss.2017.05.011
Autor:
Marek Szykuła, Maksymilian Mika
We solve open problems concerning the Kleene star $L^*$ of a finite set $L$ of words over an alphabet $\Sigma$. The \emph{Frobenius monoid} problem is the question for a given finite set of words $L$, whether the language $L^*$ is cofinite. We show t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3191a5d03c489dc5127be4af5a6dc66d
Publikováno v:
Implementation and Application of Automata ISBN: 9783319948119
CIAA
CIAA
The state complexity of a regular language \(L_m\) is the number m of states in a minimal deterministic finite automaton (DFA) accepting \(L_m\). The state complexity of a regularity-preserving binary operation on regular languages is defined as the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff173ac96837d9d58524e68c1590daf6
https://doi.org/10.1007/978-3-319-94812-6_10
https://doi.org/10.1007/978-3-319-94812-6_10
We present a novel method to predict the length of the shortest synchronizing words of a finite automaton by applying the machine learning approach. We introduce several so-called automata features which depict the structure of an automaton, and use
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a45895f2aca44756f0d0cac133e7cec0
https://ruj.uj.edu.pl/xmlui/handle/item/49364
https://ruj.uj.edu.pl/xmlui/handle/item/49364
Autor:
Marek Szykuła, Adam Roman
Publikováno v:
Expert Systems with Applications. 42:9512-9527
We describe a general framework for constructing synchronizing algorithms.We design currently the best heuristic polynomial synchronizing algorithm.Detailed analysis shows impact of various parameters on the results.Experiments are conducted on much
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::914f32197d0b5374da1293eca089ab98
https://doi.org/10.1016/j.eswa.2015.07.071
https://doi.org/10.1016/j.eswa.2015.07.071