Petr Zemek

According to our database1, Petr Zemek
  • authored at least 22 papers between 2011 and 2016.
  • has a "Dijkstra number"2 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Phrase-Structure Grammars: Normal Forms and Reduction.
Comput. J., 2016

2014
One-sided random context grammars with a limited number of right random context rules.
Theor. Comput. Sci., 2014

Solutions to four open problems concerning controlled pure grammar systems.
Int. J. Comput. Math., 2014

Controlled finite automata.
Acta Inf., 2014

One-Sided Random Context Grammars: A Survey.
Proceedings of the Computing with New Resources, 2014

Regulated Grammars and Automata
Springer, ISBN: 978-1-4939-0369-6, 2014

2013
On the generation of sentences with their parses by propagating regular-controlled grammars.
Theor. Comput. Sci., 2013

Generalized one-sided forbidding grammars.
Int. J. Comput. Math., 2013

Left Random Context ET0L Grammars.
Fundam. Inform., 2013

PsybOt malware: A step-by-step decompilation case study.
Proceedings of the 20th Working Conference on Reverse Engineering, 2013

2012
Controlled Pure Grammar Systems.
J. UCS, 2012

Jumping Finite Automata.
Int. J. Found. Comput. Sci., 2012

One-sided forbidding grammars and selective substitution grammars.
Int. J. Comput. Math., 2012

Nonterminal complexity of one-sided random context grammars.
Acta Inf., 2012

Detection and Recovery of Functions and their Arguments in a Retargetable Decompiler.
Proceedings of the 19th Working Conference on Reverse Engineering, 2012

Accurate Recovery of Functions in a Retargetable Decompiler(Poster Abstract).
Proceedings of the Research in Attacks, Intrusions, and Defenses, 2012

An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

One-Sided Random Context Grammars with Leftmost Derivations.
Proceedings of the Languages Alive, 2012

2011
Workspace theorems for regular-controlled grammars.
Theor. Comput. Sci., 2011

One-sided random context grammars.
Acta Inf., 2011

Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis.
Proceedings of the Information Security and Assurance - International Conference, 2011

On Nondeterminism in Programmed Grammars.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011


  Loading...