1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2023
Old and New Benchmarks for Relative Termination of String Rewrite Systems
Dieter Hofbauer, Johannes Waldmann
We provide a critical assessment of the current set of benchmarks for relative SRS termination in the Termination Problems Database (TPDB): most of the benchmarks in Waldmann_19 an…
cs.DS2016★ 1 cited
Efficient Completion of Weighted Automata
Johannes Waldmann
We consider directed graphs with edge labels from a semiring. We present an algorithm that allows efficient execution of queries for existence and weights of paths, and allows upda…