Jumping Grammars Z Křivka, A Meduna
International Journal of Foundations of Computer Science 26 (06), 709-731, 2015
18 2015 A jumping Watson–Crick finite automata model R Kocman, Z Křivka, A Meduna, B Nagy
Acta Informatica 59 (5), 557-584, 2022
16 2022 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
15 2014 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
13 2006 Rewriting Systems with Restricted Configurations Z Krivka
Ph. D. Thesis, Faculty of Information Technology, Brno University of …, 2008
10 2008 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
7 2011 On double-jumping finite automata. R Kocman, Z Krivka, A Meduna
NCMA, 195-210, 2016
6 2016 Cooperating distributed grammar systems with random context grammars as components Z Křivka, T Masopust
Acta Cybernetica 20 (2), 269-283, 2011
5 2011 General top-down parsers based on deep pushdown expansions Z Krivka, A Meduna, R Schönecker
Proceedings of 1st International Workshop on Formal Models (WFM’06), 11-18, 2006
5 2006 On double-jumping finite automata and their closure properties R Kocman, Z Křivka, A Meduna
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2018
4 2018 Jumping Pure Grammars Z Křivka, J Kučera, A Meduna
The Computer Journal 62 (1), 30-41, 2019
3 2019 Generalized#-Rewriting Systems of Finite Index. Z Krivka, A Meduna
Workshop on Formal Models, 2007
3 2007 Generalized#-Rewriting Systems of Finite Index. Z Krivka, A Meduna
Workshop on Formal Models, 2007
3 2007 String-partitioning systems and an infinite hierarchy Z Krivka, R Schnecker
Proceedings of 1st International Workshop on Formal Models (WFM’06), 53-60, 2006
2 2006 Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete Z Křivka, A Meduna
Fundamenta Informaticae 179 (4), 361-384, 2021
1 2021 General CD Grammar Systems and Their Simplification. R Kocman, Z Krivka, A Meduna
J. Autom. Lang. Comb. 25 (1), 37-54, 2020
1 2020 On k# $-Rewriting Systems J Kucera, Z Krivka, A Meduna
SCIENCE AND TECHNOLOGY 21 (3), 278-287, 2018
1 2018 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
1 2011 A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. Z Krivka, T Masopust
ICTCS, 129-135, 2009
1 2009 Deterministic #-rewriting systems Z Krivka
Proceedings of the 13th Conference and Competition EEICT 4, 386-390, 2007
1 2007