Publications

My publications from research, school and other areas.

Research

My main research interests are

  • formal language theory, especially regulated grammars and automata,
  • reverse engineering, especially reverse compilation (decompilation).

Books

  • A. Meduna, P. Zemek: Regulated Grammars and Automata, Springer, New York, US, 2014, 694 pages, ISBN 978-1-4939-0368-9. wwwbib
  • A. Meduna, P. Zemek: Regulated Grammars and Their Transformations, Brno, CZ, BUT, 239 pages, 2010, ISBN 978-80-214-4203-0. bib

Book Chapters

  • A. Meduna, P. Zemek. One-Sided Random Context Grammars: A Survey. LNCS Festschrift Series: Computing with New Resources – Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday, Berlin-Heidelberg, DE, Springer, 2014, pp. 338-351. wwwbib
  • A. Meduna, P. Zemek. 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, DE, Springer, 2012, pp. 160-173. wwwbib

International Journal Papers

  • A. Meduna, Z. Křivka, P. Zemek. Phrase-structure grammars: Normal forms and reduction. The Computer Journal. 59(8):1180-1185, 2016. wwwbib
  • A. Meduna, O. Soukup, P. Zemek. Ordered Pure Multi-Pushdown Automata. Theoretical and Applied Informatics. 27(1):25–47, 2015. wwwpdfbib
  • A. Meduna, L. Vrábel, P. Zemek. Solutions to four open problems concerning controlled pure grammar systems. International Journal of Computer Mathematics. 91(6):1156-1169, 2014. wwwbib
  • A. Meduna, P. Zemek. Controlled finite automata. Acta Informatica. 51(5):327-337 2014. www bib
  • A. Meduna, P. Zemek. One-sided random context grammars with a limited number of right random context rules. Theoretical Computer Science. 516(1):127-132, 2014. wwwbib
  • L. Ďurfina, J. Křoustek, P. Matula, P. Zemek: A Novel Approach to Online Retargetable Machine-Code Decompilation. Journal of Network and Innovative Computing. 2(1):224-232, 2014. pdfbib
  • A. Meduna, P. Zemek. Generalized one-sided forbidding grammars. International Journal of Computer Mathematics. 90(2):172-182, 2013. wwwbib
  • A. Meduna, P. Zemek. On the generation of sentences with their parses by propagating regular-controlled grammars. Theoretical Computer Science. 477(1):67-75, 2013. wwwbib
  • A. Meduna, P. Zemek. Left random context ET0L grammars. Fundamenta Informaticae. 123(3):289-304, 2013. wwwbib
  • A. Meduna, P. Zemek. Controlled pure grammar systems. Journal of Universal Computer Science. 18(14):2024-2040, 2012. wwwpdfbib
  • A. Meduna, P. Zemek. Jumping finite automata. International Journal of Foundations of Computer Science. 23(7):1555-1578, 2012. wwwbib
  • A. Meduna, P. Zemek. Nonterminal complexity of one-sided random context grammars. Acta Informatica. 49(2):55-68 2012. wwwbib
  • A. Meduna, P. Zemek. One-sided forbidding grammars and selective substitution grammars. International Journal of Computer Mathematics. 89(5):586-596, 2012. wwwbib
  • A. Meduna, P. Zemek. Workspace theorems for regular-controlled grammars. Theoretical Computer Science. 412(35):4604-4612, 2011. wwwbib
  • A. Meduna, P. Zemek. One-sided random context grammars. Acta Informatica. 48(3):149-163, 2011. wwwbib
  • L. Ďurfina, J. Křoustek, P. Zemek et al.: Design of a retargetable decompiler for a static platform-independent malware analysis. International Journal of Security and Its Applications. 5(4): 91-106, 2011. pdfbib

International Conference Papers

  • L. Ďurfina, J. Křoustek, P. Zemek: Retargetable machine-code decompilation in your web browser. In: WICT’13: 3rd IEEE World Congress on Information and Communication Technologies, Hanoi, VN, 2013, pp. 57-62.bib
  • L. Ďurfina, J. Křoustek, P. Zemek: Psyb0t malware: A step-by-step decompilation case study. In: WCRE’13: 20th Working Conference on Reverse Engineering, Koblenz, DE, 2013, pp. 449-456. pdfbib
  • A. Meduna, L. Vrábel, P. Zemek. 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, Braga, PT, 2012, pp. 236-243. wwwbib
  • L. Ďurfina, J. Křoustek, P. Zemek et al.: Detection and recovery of functions and their arguments in a retargetable decompiler. In: WCRE’12: 19th Working Conference on Reverse Engineering, Kingston, Ontario, CA, 2012, pp. 51-60. wwwbib
  • L. Ďurfina, J. Křoustek, P. Zemek: Generic source code migration using decompilation. In: ISC’12: 10th Annual Industrial Simulation Conference, Brno, CZ, 2012, pp. 38-42. bib
  • A. Meduna, L. Vrábel, P. Zemek. LL leftmost k-linear scattered context grammars. In: SCLIT’11: Symposium on Computer Languages, Implementations and Tools, Halkidiki, GR, 2011, pp. 833-836. wwwbib
  • A. Meduna, L. Vrábel, P. Zemek. On nondeterminism in programmed grammars. In: AFL’11: 13th International Conference on Automata and Formal Languages, Debrecen, HU, 2011, pp. 316-328. pdfbib
  • L. Ďurfina, J. Křoustek, P. Zemek et al.: Advanced static analysis for decompilation using scattered context grammars. In: ACC’11: Proceedings of the Applied Computing Conference, Angers, FR, 2011, 164-169. pdfbib
  • L. Ďurfina, J. Křoustek, P. Zemek et al.: Design of an automatically generated retargetable decompiler. In: ECCS’11: 2nd European Conference of Computer Science, Puerto de la Cruz, Tenerife, ES, 2011, pp. 199-204. pdfbib
  • L. Ďurfina, J. Křoustek, P. Zemek et al.: Design of a retargetable decompiler for a static platform-independent malware analysis. In: ISA’11: The 5th International Conference on Information Security and Assurance, Brno, CZ, 2011, pp. 72-86. bib

International Conference Posters

  • L. Ďurfina, J. Křoustek, P. Zemek et al.: Accurate recovery of functions in a retargetable decompiler. In: RAID’12: 15th International Symposium on Research in Attacks, Intrusions and Defenses, Amsterdam, NL, 2012, pp. 390-392. wwwbib
  • L. Ďurfina, J. Křoustek, P. Zemek et al.: On complex reconstruction of functions from binary executable files. In: MEMICS’12: 8th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Brno, CZ, 2012, pp. 100-101. bib
  • L. Ďurfina, J. Křoustek, P. Zemek et al.: Design of a retargetable decompiler for a static platform-independent malware analysis. In: MEMICS’11: 7th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Brno, CZ, 2011, pp. 114-114. bib

Student Competition Papers

  • P. Zemek. One-sided random context grammars: Established results and open problems. In: Proceedings of the 19th Conference and Competition STUDENT EEICT 2013, Brno, CZ, 2013, pp. 222-226. pdfbib
  • P. Zemek. Normal forms of one-sided random context grammars. In: Proceedings of the 18th Conference and Competition STUDENT EEICT 2012, Brno, CZ, 2012, pp. 430-434. pdfbib
  • P. Zemek. On the nonterminal complexity of left random context E0L grammars. In: Proceedings of the 17th Conference and Competition STUDENT EEICT 2011, Brno, CZ, 2011, pp. 510-514. pdfbib
  • P. Zemek. k-Limited erasing performed by regular-controlled context-free grammars. In: Proceedings of the 16th Conference and Competition STUDENT EEICT 2010, Brno, CZ, 2010, pp. 42-44. pdfbib
  • P. Zemek. An infinite hierarchy of language families resulting from n-limited programmed grammars. In: Proceedings of the 14th Conference STUDENT EEICT 2008, Brno, CZ, 2008, pp. 164-166. pdfbib

Theses

  • P. Zemek: One-Sided Random Context Grammars. Ph.D. Thesis, FIT BUT, Brno, CZ, 2014, pp. 127. wwwpdfbib
  • P. Zemek: On Erasing Rules in Regulated Grammars. Master’s Thesis, FIT BUT, Brno, CZ, 2010, pp. 71. wwwpdfbib
  • P. Zemek: Canonical Derivations in Programmed Grammars. Bachelor’s Thesis, FIT BUT, Brno, CZ, 2008, pp. 37. wwwpdfbib

Online Articles

Unpublished

  • P. Zemek: On state grammars with final states. pp. 3, 2010. Unpublished. pdfbib

Linux

School (EN)

School (CS)