Petr Zemek

Publication Activity (10 Years)

Years Active: 2011-2016
Publications (10 Years): 1

Top Topics

Finite Automata

Randomly Distributed

Parse Selection

Top Venues

Int. J. Comput. Math.

Acta Informatica

Theor. Comput. Sci.

Publications

Zbynek Krivka, Alexander Meduna, Petr Zemek
Phrase-Structure Grammars: Normal Forms and Reduction. Comput. J. 59 (8) (2016)
Alexander Meduna, Lukás Vrábel, Petr Zemek
Solutions to four open problems concerning controlled pure grammar systems. Int. J. Comput. Math. 91 (6) (2014)
Alexander Meduna, Petr Zemek
Controlled finite automata. Acta Informatica 51 (5) (2014)
Alexander Meduna, Petr Zemek
One-Sided Random Context Grammars: A Survey. Computing with New Resources (2014)
Alexander Meduna, Petr Zemek
One-sided random context grammars with a limited number of right random context rules. Theor. Comput. Sci. 516 (2014)
Alexander Meduna, Petr Zemek
Left Random Context ET0L Grammars. Fundam. Informaticae 123 (3) (2013)
Alexander Meduna, Petr Zemek
On the generation of sentences with their parses by propagating regular-controlled grammars. Theor. Comput. Sci. 477 (2013)
Alexander Meduna, Petr Zemek
Generalized one-sided forbidding grammars. Int. J. Comput. Math. 90 (2) (2013)
Lukás Durfina, Jakub Kroustek, Petr Zemek
PsybOt malware: A step-by-step decompilation case study. WCRE (2013)
Alexander Meduna, Petr Zemek
Nonterminal complexity of one-sided random context grammars. Acta Informatica 49 (2) (2012)
Alexander Meduna, Petr Zemek
Jumping Finite Automata. Int. J. Found. Comput. Sci. 23 (7) (2012)
Alexander Meduna, Petr Zemek
One-sided forbidding grammars and selective substitution grammars. Int. J. Comput. Math. 89 (5) (2012)
Alexander Meduna, Petr Zemek
One-Sided Random Context Grammars with Leftmost Derivations. Languages Alive (2012)
Alexander Meduna, Lukás Vrábel, Petr Zemek
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. DCFS (2012)
Alexander Meduna, Petr Zemek
Controlled Pure Grammar Systems. J. Univers. Comput. Sci. 18 (14) (2012)
Lukás Durfina, Jakub Kroustek, Petr Zemek, Bretislav Kábele
Accurate Recovery of Functions in a Retargetable Decompiler(Poster Abstract). RAID (2012)
Lukás Durfina, Jakub Kroustek, Petr Zemek, Bretislav Kábele
Detection and Recovery of Functions and their Arguments in a Retargetable Decompiler. WCRE (2012)
Alexander Meduna, Petr Zemek
Workspace theorems for regular-controlled grammars. Theor. Comput. Sci. 412 (35) (2011)
Alexander Meduna, Lukás Vrábel, Petr Zemek
On Nondeterminism in Programmed Grammars. AFL (2011)
Alexander Meduna, Petr Zemek
One-sided random context grammars. Acta Informatica 48 (3) (2011)
Lukás Durfina, Jakub Kroustek, Petr Zemek, Dusan Kolár, Tomás Hruska, Karel Masarík, Alexander Meduna
Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. ISA (2011)