On the reformulation of some classes of PNS-problems as set covering problems

Most read articles by the same author(s)

• Balázs Imreh, Magnus Steinby, Directable nondeterministic automata , Acta Cybernetica: Vol. 14 No. 1 (1999)
• Zoltán Ésik, Balázs Imreh, Subdirectly irreducible commutative automata , Acta Cybernetica: Vol. 5 No. 3 (1981)
• Zoltán Ésik, Balázs Imreh, Remarks on finite commutative automata , Acta Cybernetica: Vol. 5 No. 2 (1981)
• Balázs Imreh, Masami Ito, A. Pukler, On commutative asynchronous nondeterministic automata , Acta Cybernetica: Vol. 14 No. 4 (2000)
• Pál Dömösi, Balázs Imreh, On vi-products of automata , Acta Cybernetica: Vol. 6 No. 2 (1983)
• Balázs Imreh, János Fülöp, Ferenc Friedler, A note on the equivalence of the set covering and process network synthesis problems , Acta Cybernetica: Vol. 14 No. 3 (2000)
• Ferenc Gécseg, Balázs Imreh, On metric equivalence of vi-products , Acta Cybernetica: Vol. 8 No. 2 (1987)
• Balázs Imreh, Masami Ito, On regular languages determined by nondeterministic directable automata , Acta Cybernetica: Vol. 17 No. 1 (2005)
• János Csirik, Balázs Imreh, On the worst-case performance of the NkF bin-packing heuristic , Acta Cybernetica: Vol. 9 No. 2 (1989)
• Balázs Imreh, Csanád Imreh, Masami Ito, On directable nondeterministic trapped automata , Acta Cybernetica: Vol. 16 No. 1 (2003)