Follow
Zbyněk Křivka
Zbyněk Křivka
Assistant Professor, Brno University of Technology, Czech republic
Verified email at fit.vutbr.cz - Homepage
Title
Cited by
Cited by
Year
Jumping Grammars
Z Křivka, A Meduna
International Journal of Foundations of Computer Science 26 (06), 709-731, 2015
182015
A jumping 5 ′ → 3 ′ Watson–Crick finite automata model
R Kocman, Z Křivka, A Meduna, B Nagy
Acta Informatica, 1-28, 2022
122022
A variant of pure two-dimensional context-free grammars generating picture languages
Z Křivka, C Martín-Vide, A Meduna, KG Subramanian
International Workshop on Combinatorial Image Analysis, 123-133, 2014
122014
Generation of languages by rewriting systems that resemble automata
Z Křivka, A Meduna, R Schönecker
International Journal of Foundations of Computer Science 17 (05), 1223-1229, 2006
122006
Rewriting Systems with Restricted Configurations
Z Krivka
Ph. D. Thesis, Faculty of Information Technology, Brno University of …, 2008
82008
On double-jumping finite automata.
R Kocman, Z Krivka, A Meduna
NCMA, 195-210, 2016
62016
Pumping properties of path-restricted tree-controlled languages
J Koutný, Z Krivka, A Meduna
7th Doctoral Workshop on Mathematical and Engineering Methods in Computer …, 2011
62011
On double-jumping finite automata and their closure properties
R Kocman, Z Křivka, A Meduna
RAIRO-Theoretical Informatics and Applications 52 (2-3-4), 185-199, 2018
42018
Cooperating distributed grammar systems with random context grammars as components
Z Křivka, T Masopust
Acta Cybernetica 20 (2), 269-283, 2011
42011
Jumping Pure Grammars
Z Křivka, J Kučera, A Meduna
The Computer Journal 62 (1), 30-41, 2019
32019
Generalized#-Rewriting Systems of Finite Index.
Z Krivka, A Meduna
Workshop on Formal Models, 2007
22007
Generalized#-Rewriting Systems of Finite Index.
Z Krivka, A Meduna
Workshop on Formal Models, 2007
22007
String-partitioning systems and an infinite hierarchy
Z Krivka, R Schnecker
Proceedings of 1st International Workshop on Formal Models (WFM’06), 53-60, 2006
22006
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete
Z Křivka, A Meduna
Fundamenta Informaticae 179 (4), 361-384, 2021
12021
General CD Grammar Systems and Their Simplification.
R Kocman, Z Krivka, A Meduna
J. Autom. Lang. Comb. 25 (1), 37-54, 2020
12020
On k# $-Rewriting Systems
J Kucera, Z Krivka, A Meduna
SCIENCE AND TECHNOLOGY 21 (3), 278-287, 2018
12018
The virtualization of development boards in the virtual laboratory of microprocessor technology
Z Vašíček, Z Křivka
2011 12th International Carpathian Control Conference (ICCC), 420-424, 2011
12011
A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking.
Z Krivka, T Masopust
ICTCS, 129-135, 2009
12009
Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars
J Hammer, Z Křivka
arXiv preprint arXiv:2209.03655, 2022
2022
Conclusive Tree-Controlled Grammars
D Klobučníková, Z Křivka, A Meduna
arXiv preprint arXiv:2208.14728, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–20