Jumping Grammars Z Křivka, A Meduna International Journal of Foundations of Computer Science 26 (06), 709-731, 2015 | 20 | 2015 |
A jumping Watson–Crick finite automata model R Kocman, Z Křivka, A Meduna, B Nagy Acta Informatica 59 (5), 557-584, 2022 | 19 | 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 | 17 | 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 | 14 | 2006 |
Rewriting Systems with Restricted Configurations Z Krivka Ph. D. Thesis, Faculty of Information Technology, Brno University of …, 2008 | 11 | 2008 |
On double-jumping finite automata. R Kocman, Z Krivka, A Meduna NCMA, 195-210, 2016 | 7 | 2016 |
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 |
Cooperating distributed grammar systems with random context grammars as components Z Křivka, T Masopust Acta Cybernetica 20 (2), 269-283, 2011 | 6 | 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 | 6 | 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 | 5 | 2018 |
Reducing deep pushdown automata and infinite hierarchy Z Krivka, A Meduna, R Schnecker MEMICS 2006 Second Doctoral Workshop on Mathematical and Engineering Methods …, 2006 | 5 | 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 | 4 | 2021 |
Jumping Pure Grammars Z Křivka, J Kučera, A Meduna The Computer Journal 62 (1), 30-41, 2019 | 4 | 2019 |
Generalized#-Rewriting Systems of Finite Index. Z Krivka, A Meduna Workshop on Formal Models, 2007 | 4 | 2007 |
Generalized#-Rewriting Systems of Finite Index. Z Krivka, A Meduna Workshop on Formal Models, 2007 | 4 | 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 |
Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars J Hammer, Z Křivka arXiv preprint arXiv:2209.03655, 2022 | 1 | 2022 |
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages J Martiško, A Meduna, Z Křivka International Journal of Foundations of Computer Science 33 (03n04), 335-348, 2022 | 1 | 2022 |
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 |