( en | de | ru )

 

Disambiguation of "Németh, Zoltán L."

Author of the publication

copydeleteadd this publication to your clipboard
When every byte counts - Writing minimal length shellcodes.

, and . SISY, page 269-274. IEEE, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Zsuzsa Németh

Róbert Németh

Kálmán Németh

Igor Németh

Marianna Németh

 

Other publications of authors with the same name

Automata on Infinite Biposets.. Acta Cybern., 17 (4): 765-797 (2006)A Kleene Theorem for Bisemigroup and binoid Languages., and . Int. J. Found. Comput. Sci., 22 (2): 427-446 (2011)Algebraic and graph-theoretic properties of infinite n-posets., and . RAIRO Theor. Informatics Appl., 39 (1): 305-322 (2005)Higher Dimensional Automata., and . Journal of Automata, Languages and Combinatorics, 9 (1): 3-29 (2004)A Hierarchy Theorem for Regular Languages over Free Bisemigroups.. Acta Cybern., 16 (4): 567-577 (2004)On the Regularity of Binoid Languages: A Comparative Approach.. LATA, Report 35/07, page 449-460. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, (2007)A Kleene Theorem for Binoid Languages., and . AFL, page 170-182. (2008)Modern binary attacks and defences in the windows environment - Fighting against microsoft EMET in seven rounds.. SISY, page 275-280. IEEE, (2015)Automata on Series-Parallel Biposets., and . Developments in Language Theory, volume 2295 of Lecture Notes in Computer Science, page 217-227. Springer, (2001)When every byte counts - Writing minimal length shellcodes., and . SISY, page 269-274. IEEE, (2015)