4 papers · 1 filter
Proceedings of the 16th International Conference on Automata and Formal Languages
Zsolt Gazdag, Szabolcs Iván, Gergely Kovásznai
The 16th International Conference on Automata and Formal Languages (AFL 2023) was held in Eger, September 5-7, 2023. It was organized by the Eszterházy Károly Catholic University o…
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…