Petr Zemek - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2016

Phrase-Structure Grammars: Normal Forms and ReductionZbynek Krivka, Alexander Meduna, Petr Zemek. cj, 59(8):1180-1185, 2016. [doi]

2014

Regulated Grammars and AutomataAlexander Meduna, Petr Zemek. Springer, 2014. [doi]

One-Sided Random Context Grammars: A SurveyAlexander Meduna, Petr Zemek. BIRTHDAY 2014: 338-351 [doi]

Solutions to four open problems concerning controlled pure grammar systemsAlexander Meduna, Lukás Vrábel, Petr Zemek. ijcm, 91(6):1156-1169, 2014. [doi]

One-sided random context grammars with a limited number of right random context rulesAlexander Meduna, Petr Zemek. TCS, 516:127-132, 2014. [doi]

Controlled finite automataAlexander Meduna, Petr Zemek. ACTA, 51(5):327-337, 2014. [doi]

2013

PsybOt malware: A step-by-step decompilation case studyLukás Durfina, Jakub Kroustek, Petr Zemek. WCRE 2013: 449-456 [doi]

On the generation of sentences with their parses by propagating regular-controlled grammarsAlexander Meduna, Petr Zemek. TCS, 477:67-75, 2013. [doi]

Left Random Context ET0L GrammarsAlexander Meduna, Petr Zemek. FUIN, 123(3):289-304, 2013. [doi]

Generalized one-sided forbidding grammarsAlexander Meduna, Petr Zemek. ijcm, 90(2):172-182, 2013. [doi]

2012

Accurate Recovery of Functions in a Retargetable Decompiler(Poster Abstract)Lukás Durfina, Jakub Kroustek, Petr Zemek, Bretislav Kábele. raid 2012: 390-392 [doi]

Detection and Recovery of Functions and their Arguments in a Retargetable DecompilerLukás Durfina, Jakub Kroustek, Petr Zemek, Bretislav Kábele. WCRE 2012: 51-60 [doi]

One-Sided Random Context Grammars with Leftmost DerivationsAlexander Meduna, Petr Zemek. BIRTHDAY 2012: 160-173 [doi]

An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown AlphabetsAlexander Meduna, Lukás Vrábel, Petr Zemek. dcfs 2012: 236-243 [doi]

Jumping Finite AutomataAlexander Meduna, Petr Zemek. ijfcs, 23(7):1555, 2012. [doi]

Nonterminal complexity of one-sided random context grammarsAlexander Meduna, Petr Zemek. ACTA, 49(2):55-68, 2012. [doi]

Controlled Pure Grammar SystemsAlexander Meduna, Petr Zemek. jucs, 18(14):2024-2040, 2012. [doi]

One-sided forbidding grammars and selective substitution grammarsAlexander Meduna, Petr Zemek. ijcm, 89(5):586-596, 2012. [doi]

2011

Sign in or sign up to see more results.

runs on WebDSL