default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetr Zemek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j13]Zbynek Krivka
, Alexander Meduna, Petr Zemek:
Phrase-Structure Grammars: Normal Forms and Reduction. Comput. J. 59(8): 1180-1185 (2016)- 2014
- [b1]Alexander Meduna, Petr Zemek:
Regulated Grammars and Automata. Springer 2014, ISBN 978-1-4939-0368-9, pp. 1-678 - [j12]Alexander Meduna, Petr Zemek:
Controlled finite automata. Acta Informatica 51(5): 327-337 (2014) - [j11]Alexander Meduna, Lukás Vrábel, Petr Zemek:
Solutions to four open problems concerning controlled pure grammar systems. Int. J. Comput. Math. 91(6): 1156-1169 (2014) - [j10]Alexander Meduna, Petr Zemek:
One-sided random context grammars with a limited number of right random context rules. Theor. Comput. Sci. 516: 127-132 (2014) - [c8]Alexander Meduna, Petr Zemek:
One-Sided Random Context Grammars: A Survey. Computing with New Resources 2014: 338-351 - 2013
- [j9]Alexander Meduna, Petr Zemek:
Left Random Context ET0L Grammars. Fundam. Informaticae 123(3): 289-304 (2013) - [j8]Alexander Meduna, Petr Zemek:
Generalized one-sided forbidding grammars. Int. J. Comput. Math. 90(2): 172-182 (2013) - [j7]Alexander Meduna, Petr Zemek:
On the generation of sentences with their parses by propagating regular-controlled grammars. Theor. Comput. Sci. 477: 67-75 (2013) - [c7]Lukás Durfina, Jakub Kroustek, Petr Zemek:
PsybOt malware: A step-by-step decompilation case study. WCRE 2013: 449-456 - 2012
- [j6]Alexander Meduna, Petr Zemek:
Nonterminal complexity of one-sided random context grammars. Acta Informatica 49(2): 55-68 (2012) - [j5]Alexander Meduna, Petr Zemek:
One-sided forbidding grammars and selective substitution grammars. Int. J. Comput. Math. 89(5): 586-596 (2012) - [j4]Alexander Meduna, Petr Zemek:
Jumping Finite Automata. Int. J. Found. Comput. Sci. 23(7): 1555-1578 (2012) - [j3]Alexander Meduna, Petr Zemek:
Controlled Pure Grammar Systems. J. Univers. Comput. Sci. 18(14): 2024-2040 (2012) - [c6]Alexander Meduna, Petr Zemek:
One-Sided Random Context Grammars with Leftmost Derivations. Languages Alive 2012: 160-173 - [c5]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: 236-243 - [c4]Lukás Durfina, Jakub Kroustek, Petr Zemek, Bretislav Kábele:
Accurate Recovery of Functions in a Retargetable Decompiler(Poster Abstract). RAID 2012: 390-392 - [c3]Lukás Durfina, Jakub Kroustek, Petr Zemek, Bretislav Kábele:
Detection and Recovery of Functions and their Arguments in a Retargetable Decompiler. WCRE 2012: 51-60 - 2011
- [j2]Alexander Meduna, Petr Zemek:
One-sided random context grammars. Acta Informatica 48(3): 149-163 (2011) - [j1]Alexander Meduna, Petr Zemek:
Workspace theorems for regular-controlled grammars. Theor. Comput. Sci. 412(35): 4604-4612 (2011) - [c2]Alexander Meduna, Lukás Vrábel, Petr Zemek:
On Nondeterminism in Programmed Grammars. AFL 2011: 315-327 - [c1]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: 72-86
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
