3 papers
cs.FL2014
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…
cs.FL2014
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…
cs.FL2014
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…