1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2024
Deterministic Weighted Automata under Partial Observability
Jakub Michaliszyn, Jan Otop
Weighted automata is a basic tool for specification in quantitative verification, which allows to express quantitative features of analysed systems such as resource consumption. Qu…
cs.DB2012★ 1 cited
On Injective Embeddings of Tree Patterns
Jakub Michaliszyn, Anca Muscholl, Sławek Staworko +2
We study three different kinds of embeddings of tree patterns: weakly-injective, ancestor-preserving, and lca-preserving. While each of them is often referred to as injective embed…