4 citations · 11 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.FL2017
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…
cs.DB2017★ 1 cited
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…