27 citations · 28 across the 7 of their papers we have counts for
3 papers · 1 filter
Average Stack Cost of Buechi Pushdown Automata
Jakub Michaliszyn, Jan Otop
We study the average stack cost of Buechi pushdown automata (Buechi PDA). We associate a non-negative price with each stack symbol and define the cost of a stack as the sum of cost…
Querying Best Paths in Graph Databases
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
Querying graph databases has recently received much attention. We propose a new approach to this problem, which balances competing goals of expressive power, language clarity and c…
Bidirectional Nested Weighted Automata
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
Nested weighted automata (NWA) present a robust and convenient automata-theoretic formalism for quantitative specifications. Previous works have considered NWA that processed input…