Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Michaliszyn, Jakub
35  Ergebnisse:
Online X
Personensuche X
?
1

Deterministic Weighted Automata Under Partial Observability:

, In: Logics in Artificial Intelligence; Lecture Notes in Computer Science,
Michaliszyn, Jakub ; Otop, Jan - p. 771-784 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Reachability and Bounded Emptiness Problems of Constraint A..:

Michaliszyn, Jakub ; Otop, Jan ; Wieczorek, Piotr
doi:10.4230/LIPIcs.CONCUR.2023.3.  , 2023
Link: https://doi.org/10.4230/..
 
?
3

Learning infinite-word automata with loop-index queries:

Michaliszyn, Jakub ; Otop, Jan
Artificial Intelligence.  307 (2022)  - p. 103710 , 2022
Link: https://doi.org/10.1016/..
 
?
4

Learning Deterministic Visibly Pushdown Automata Under Acce..:

Michaliszyn, Jakub ; Otop, Jan
doi:10.4230/LIPIcs.MFCS.2022.74.  , 2022
Link: https://doi.org/10.4230/..
 
?
5

"Most of" leads to undecidability: Failure of adding freque..:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,
Bednarczyk, Bartosz ; Michaliszyn, Jakub - p. 82-101 , 2021
Link: https://doi.org/10.1007/..
 
?
6

Modular Path Queries with Arithmetic:

Michaliszyn, Jakub ; Otop, Jan ; Wieczorek, Piotr
Logical Methods in Computer Science.  17, Issue 3 (2021)  - p. , 2021
Link: https://doi.org/10.46298..
 
?
7

"Most of" leads to undecidability: Failure of adding freque..:

Bednarczyk, Bartosz ; Michaliszyn, Jakub
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC7984134/.  , 2021
Link: http://www.ncbi.nlm.nih...
 
?
8

Modular Path Queries with Arithmetic:

Jakub Michaliszyn ; Jan Otop ; Piotr Wieczorek
https://lmcs.episciences.org/6091/pdf.  , 2021
Link: https://doi.org/10.46298..
 
?
9

Non-deterministic weighted automata evaluated over Markov c..:

Michaliszyn, Jakub ; Otop, Jan
Journal of Computer and System Sciences.  108 (2020)  - p. 118-136 , 2020
Link: https://doi.org/10.1016/..
 
?
10

Modular Path Queries with Arithmetic:

Michaliszyn, Jakub ; Otop, Jan ; Wieczorek, Piotr
http://arxiv.org/abs/2002.04460.  , 2020
Link: http://arxiv.org/abs/200..
 
?
11

"Most of" leads to undecidability: Failure of adding freque..:

Bednarczyk, Bartosz ; Michaliszyn, Jakub
http://arxiv.org/abs/2007.01233.  , 2020
Link: http://arxiv.org/abs/200..
 
?
12

Approximate Learning of Limit-Average Automata:

Michaliszyn, Jakub ; Otop, Jan
Is Part Of LIPIcs, Volume 140, 30th International Conference on Concurrency Theory (CONCUR 2019).  , 2019
Link: https://doi.org/10.4230/..
 
?
13

Non-deterministic weighted automata evaluated over Markov c..:

Michaliszyn, Jakub ; Otop, Jan
http://arxiv.org/abs/1908.04625.  , 2019
Link: http://arxiv.org/abs/190..
 
?
14

Approximate Learning of Limit-Average Automata:

Michaliszyn, Jakub ; Otop, Jan
http://arxiv.org/abs/1906.11104.  , 2019
Link: http://arxiv.org/abs/190..
 
?
15

Non-deterministic Weighted Automata on Random Words:

Michaliszyn, Jakub ; Otop, Jan
doi:10.4230/LIPIcs.CONCUR.2018.10.  , 2018
Link: https://doi.org/10.4230/..
 
1-15