5 citations · 16 across the 17 of their papers we have counts for
5 papers · 2 filters
Biclique coverings, rectifier networks and the cost of -removal
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György +2
We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number and the minimal rectifier network size of a b…
On state complexity of unions of binary factor-free languages
Szabolcs Ivan
It has been conjectured in 2011 by Brzozowski et al. that if and are factor-free regular languages over a binary alphabet having state complexity and , resp, then th…
Complexity of Atoms, Combinatorially
Szabolcs Ivan
Atoms of a (regular) language were introduced by Brzozowski and Tamm in 2011 as intersections of complemented and uncomplemented quotients of . They derived tight upper boun…
Synchronizing weighted automata
Szabolcs Iván
We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K=(K,+,*,0,1). (or equivalently, to finite sets of matrices in…
On nonpermutational transformation semigroups with an application to syntactic complexity
Szabolcs Ivan, Judit Nagy-Gyorgy
We give an upper bound of for the possible largest size of a subsemigroup of the full transformational semigroup over elements consisting only of nonpermutat…