Faculty of Information Technology, BUT

Ing.

Petr Zemek

Publications

  • 2016

    KŘIVKA Zbyněk, MEDUNA Alexander and ZEMEK Petr. Phrase-Structure Grammars: Normal Forms and Reduction. The Computer Journal, vol. 59, no. 8, pp. 1180-1185. ISSN 0010-4620.
    Detail

  • 2015

    MEDUNA Alexander, SOUKUP Ondřej and ZEMEK Petr. Ordered Pure Multi-Pushdown Automata. Theoretical and Applied Informatics, vol. 27, no. 1, pp. 25-47. ISSN 1896-5334.
    Detail

  • 2014

    ĎURFINA Lukáš, KŘOUSTEK Jakub, MATULA Peter and ZEMEK Petr. A Novel Approach to Online Retargetable Machine-Code Decompilation. Journal of Network and Innovative Computing (JNIC), vol. 2, no. 1, pp. 224-232. ISSN 2160-2174.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Controlled Finite Automata. Acta Informatica, vol. 51, no. 5, pp. 327-337. ISSN 0001-5903.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. Theoretical Computer Science, vol. 516, no. 1, pp. 127-132. ISSN 0304-3975.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Random Context Grammars: A Survey. Computing with New Resources. Berlin: Springer Verlag, 2014, pp. 338-351. ISBN 978-3-319-13349-2.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Regulated Grammars and Automata. New York: Springer US, 2014. ISBN 978-1-4939-0368-9.
    Detail

    MEDUNA Alexander, VRÁBEL Lukáš and ZEMEK Petr. Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems. International Journal of Computer Mathematics, vol. 91, no. 6, pp. 1156-1169. ISSN 0020-7160.
    Detail

  • 2013

    MEDUNA Alexander and ZEMEK Petr. Generalized One-Sided Forbidding Grammars. International Journal of Computer Mathematics, vol. 90, no. 2, pp. 172-182. ISSN 0020-7160.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Left Random Context ET0L Grammars. Fundamenta Informaticae, vol. 123, no. 3, pp. 289-304. ISSN 0169-2968.
    Detail

    MEDUNA Alexander and ZEMEK Petr. On the Generation of Sentences with Their Parses by Propagating Regular-Controlled Grammars. Theoretical Computer Science, vol. 477, no. 1, pp. 67-75. ISSN 0304-3975.
    Detail

    ZEMEK Petr. One-Sided Random Context Grammars: Established Results and Open Problems. In: Proceedings of the 19th Conference STUDENT EEICT 2013 Volume 3. Brno: Brno University of Technology, 2013, pp. 222-226. ISBN 978-80-214-4695-3.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub and ZEMEK Petr. Psyb0t Malware: A Step-By-Step Decompilation Case Study. In: 20th Working Conference on Reverse Engineering (WCRE). Koblenz: IEEE Computer Society, 2013, pp. 449-456. ISBN 978-1-4799-2930-6.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub and ZEMEK Petr. Retargetable Machine-Code Decompilation in Your Web Browser. In: 3rd IEEE World Congress on Information and Communication Technologies (WICT 2013). Hanoi: IEEE Computer Society, 2013, pp. 57-62. ISBN 978-1-4799-3230-6.
    Detail

  • 2012

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr and KÁBELE Břetislav. Accurate Recovery of Functions in a Retargetable Decompiler. In: The 15th International Symposium on Research in Attacks, Intrusions and Defenses (RAID 2012). Lecture Notes in Computer Science, vol. 7462. Amsterdam: Springer Verlag, 2012, pp. 390-392. ISBN 978-3-642-33337-8.
    Detail

    MEDUNA Alexander, VRÁBEL Lukáš and ZEMEK Petr. An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. In: DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science, vol. 7386. Braga: Springer Verlag, 2012, pp. 236-243. ISBN 978-3-642-31622-7. ISSN 0302-9743.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Controlled Pure Grammar Systems. Journal of Universal Computer Science, vol. 18, no. 14, pp. 2024-2040. ISSN 0948-6968.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr and KÁBELE Břetislav. Detection and Recovery of Functions and their Arguments in a Retargetable Decompiler. In: 19th Working Conference on Reverse Engineering (WCRE 2012). Kingston, Ontario: IEEE Computer Society, 2012, pp. 51-60. ISBN 978-0-7695-4891-3.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub and ZEMEK Petr. Generic Source Code Migration Using Decompilation. In: 10th Annual Industrial Simulation Conference (ISC'2012). Brno: EUROSIS, 2012, pp. 38-42. ISBN 978-90-77381-71-7.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Jumping Finite Automata. International Journal of Foundations of Computer Science, vol. 23, no. 7, pp. 1555-1578. ISSN 0129-0541.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Nonterminal Complexity of One-Sided Random Context Grammars. Acta Informatica, vol. 49, no. 2, pp. 55-68. ISSN 0001-5903.
    Detail

    ZEMEK Petr. Normal Forms of One-Sided Random Context Grammars. In: Proceedings of the 18th Conference STUDENT EEICT 2012 Volume 3. Brno: Brno University of Technology, 2012, pp. 430-434. ISBN 978-80-214-4462-1.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KÁBELE Břetislav and KOLÁŘ Dušan. On Complex Reconstruction of Functions from Binary Executable Files. In: 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2012, pp. 100-101. ISBN 978-80-87342-15-2.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Forbidding Grammars and Selective Substitution Grammars. International Journal of Computer Mathematics, vol. 89, no. 5, pp. 586-596. ISSN 0020-7160.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Random Context Grammars with Leftmost Derivations. LNCS Festschrift Series: Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Berlin-Heidelberg: Springer Verlag, 2012, pp. 160-173. ISBN 978-3-642-31643-2.
    Detail

  • 2011

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Advanced Static Analysis for Decompilation Using Scattered Context Grammars. In: Proceedings of the Applied Computing Conference 2011 (ACC'11). Angers: World Scientific and Engineering Academy, 2011, pp. 164-169. ISBN 978-1-61804-051-0.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. In: 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Masaryk University, 2011, pp. 114-114. ISBN 978-80-214-4305-1.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. International Journal of Security and Its Applications, vol. 5, no. 4, pp. 91-106. ISSN 1738-9976.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. In: The 5th International Conference on Information Security and Assurance. Communications in Computer and Information Science, Volume 200. Brno: Springer Verlag, 2011, pp. 72-86. ISBN 978-3-642-23140-7.
    Detail

    ĎURFINA Lukáš, KŘOUSTEK Jakub, ZEMEK Petr, KOLÁŘ Dušan, HRUŠKA Tomáš, MASAŘÍK Karel and MEDUNA Alexander. Design of an Automatically Generated Retargetable Decompiler. In: 2nd European Conference of COMPUTER SCIENCE (ECCS'11). Puerto De La Cruz, Tenerife: North Atlantic University Union, 2011, pp. 199-204. ISBN 978-1-61804-056-5.
    Detail

    MEDUNA Alexander, VRÁBEL Lukáš and ZEMEK Petr. LL Leftmost k-Linear Scattered Context Grammars. In: AIP Conference Proceedings. Kassandra, Halkidiki: American Institute of Physics, 2011, pp. 833-836. ISBN 978-0-7354-0956-9. ISSN 1551-7616.
    Detail

    MEDUNA Alexander, VRÁBEL Lukáš and ZEMEK Petr. On Nondeterminism in Programmed Grammars. In: 13th International Conference on Automata and Formal Languages. Debrecen: Computer and Automation Research Institute, Hungarian Academy of Sciences, 2011, pp. 316-328. ISBN 978-615-5097-19-5.
    Detail

    ZEMEK Petr. On the Nonterminal Complexity of Left Random Context E0L Grammars. In: Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3. Brno: Faculty of Information Technology BUT, 2011, pp. 510-514. ISBN 978-80-214-4273-3.
    Detail

    MEDUNA Alexander and ZEMEK Petr. One-Sided Random Context Grammars. Acta Informatica, vol. 48, no. 3, pp. 149-163. ISSN 0001-5903.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Workspace Theorems for Regular-Controlled Grammars. Theoretical Computer Science, vol. 412, no. 35, pp. 4604-4612. ISSN 0304-3975.
    Detail

  • 2010

    ZEMEK Petr. k-Limited Erasing Performed by Regular-Controlled Context-Free Grammars. In: Proceedings of the 16th Conference and Competition STUDENT EEICT 2010. Volume 3. Brno: Faculty of Information Technology BUT, 2010, pp. 42-44. ISBN 978-80-214-4078-4.
    Detail

    MEDUNA Alexander and ZEMEK Petr. Regulated Grammars and Their Transformations. Brno: Brno University of Technology, 2010. ISBN 978-80-214-4203-0.
    Detail

  • 2008

    ZEMEK Petr. An Infinite Hierarchy of Language Families Resulting from n-limited Programmed Grammars. In: Proceedings of the 14th Conference STUDENT EEICT 2008. Volume 1. Brno: Faculty of Electrical Engineering and Communication BUT, 2008, pp. 164-166. ISBN 978-80-214-3614-5.
    Detail

    ZEMEK Petr. Canonical Derivations in Programmed Grammars. Brno: Faculty of Information Technology BUT, 2008.
    Detail

Back to top