5 citations · 16 across the 17 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.FL2017★ 2 cited
Reversible Languages Having Finitely Many Reduced Automata
Kitti Gelle, Szabolcs Iván
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minima…
cs.DS2017
Recognizing Union-Find trees built up using union-by-rank strategy is NP-complete
Kitti Gelle, Szabolcs Ivan
Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact…