default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZbynek Krivka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Martin Havel, Zbynek Krivka, Alexander Meduna:
How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars. NCMA 2024: 86-99- 2023
- [c10]Tomás Kozár, Zbynek Krivka
, Alexander Meduna:
Final Sentential Forms. NCMA 2023: 38-47 - 2022
- [j10]Radim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy:
A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model. Acta Informatica 59(5): 557-584 (2022) - [j9]Jakub Martisko, Alexander Meduna, Zbynek Krivka:
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. Int. J. Found. Comput. Sci. 33(3&4): 335-348 (2022) - [c9]Jan Hammer, Zbynek Krivka:
Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars. NCMA 2022: 88-111 - [c8]Dominika Klobucníková, Zbynek Krivka, Alexander Meduna:
Conclusive Tree-Controlled Grammars. NCMA 2022: 112-125 - 2021
- [j8]Zbynek Krivka, Alexander Meduna:
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete. Fundam. Informaticae 179(4): 361-384 (2021) - 2020
- [j7]Radim Kocman, Zbynek Krivka, Alexander Meduna:
General CD Grammar Systems and Their Simplification. J. Autom. Lang. Comb. 25(1): 37-54 (2020)
2010 – 2019
- 2019
- [j6]Zbynek Krivka, Jirí Kucera, Alexander Meduna:
Jumping Pure Grammars. Comput. J. 62(1): 30-41 (2019) - 2018
- [j5]Radim Kocman, Zbynek Krivka, Alexander Meduna:
On double-jumping finite automata and their closure properties. RAIRO Theor. Informatics Appl. 52(2-3-4): 185-199 (2018) - [c7]Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna:
A jumping 5' → 3' Watson-Crick finite automata model. NCMA 2018: 117-132 - 2016
- [j4]Zbynek Krivka, Alexander Meduna, Petr Zemek:
Phrase-Structure Grammars: Normal Forms and Reduction. Comput. J. 59(8): 1180-1185 (2016) - [c6]Radim Kocman, Zbynek Krivka, Alexander Meduna:
On double-jumping finite automata. NCMA 2016: 195-210 - 2015
- [j3]Zbynek Krivka, Alexander Meduna:
Jumping Grammars. Int. J. Found. Comput. Sci. 26(6): 709-732 (2015) - 2014
- [c5]Zbynek Krivka, Carlos Martín-Vide, Alexander Meduna, K. G. Subramanian:
A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages. IWCIA 2014: 123-133 - 2011
- [j2]Zbynek Krivka, Tomás Masopust:
Cooperating Distributed Grammar Systems with Random Context Grammars as Components. Acta Cybern. 20(2): 269-283 (2011)
2000 – 2009
- 2009
- [c4]Zbynek Krivka, Ota Jirák:
Design and implementation of back-end for Picoblaze C compiler. IADIS AC (2) 2009: 135-138 - [c3]Zbynek Krivka, Tomás Masopust:
A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. ICTCS 2009: 129-135 - 2007
- [c2]Zbynek Krivka, Alexander Meduna:
Generalized #-Rewriting Systems of Finite Index. Workshop on Formal Models 2007 - [c1]Lubos Lorenc, Rudolf Schönecker, Zbynek Krivka:
A Note on the Parsing of Complete VHDL-2002. Workshop on Formal Models 2007 - 2006
- [j1]Zbynek Krivka, Alexander Meduna, Rudolf Schönecker:
Generation of Languages by Rewriting Systems that Resemble Automata. Int. J. Found. Comput. Sci. 17(5): 1223-1230 (2006)
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-11-25 23:39 CET 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:
