Generation of Languages by Rewriting Systems that Resemble Automata. - Zbynek Krivka; Alexander Meduna; Rudolf Schönecker (Int. J. Found. Comput. Sci., 2006)

Generalized #-Rewriting Systems of Finite Index. - Zbynek Krivka; Alexander Meduna (Workshop on Formal Models, 2007)

A Note on the Parsing of Complete VHDL-2002. - Lubos Lorenc; Rudolf Schönecker; Zbynek Krivka (Workshop on Formal Models, 2007)

Design and implementation of back-end for Picoblaze C compiler. - Zbynek Krivka; Ota Jirák (IADIS AC (2), 2009)

A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking. - Zbynek Krivka; Tomás Masopust (ICTCS, 2009)

Cooperating Distributed Grammar Systems with Random Context Grammars as Components. - Zbynek Krivka; Tomás Masopust (Acta Cybern., 2011)

A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages. - Zbynek Krivka; Carlos Martín-Vide; Alexander Meduna; K. G. Subramanian 001 (IWCIA, 2014)

Jumping Grammars. - Zbynek Krivka; Alexander Meduna (Int. J. Found. Comput. Sci., 2015)

On double-jumping finite automata. - Radim Kocman; Zbynek Krivka; Alexander Meduna (NCMA, 2016)

Phrase-Structure Grammars: Normal Forms and Reduction. - Zbynek Krivka; Alexander Meduna; Petr Zemek (Comput. J., 2016)

A jumping 5' → 3' Watson-Crick finite automata model. - Radim Kocman; Benedek Nagy; Zbynek Krivka; Alexander Meduna (NCMA, 2018)

On double-jumping finite automata and their closure properties. - Radim Kocman; Zbynek Krivka; Alexander Meduna (RAIRO Theor. Informatics Appl., 2018)

Jumping Pure Grammars. - Zbynek Krivka; Jirí Kucera; Alexander Meduna (Comput. J., 2019)

General CD Grammar Systems and Their Simplification. - Radim Kocman; Zbynek Krivka; Alexander Meduna (J. Autom. Lang. Comb., 2020)

Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete. - Zbynek Krivka; Alexander Meduna (Fundam. Informaticae, 2021)

A jumping $5' rightarrow 3'$ Watson-Crick finite automata model. - Radim Kocman; Zbynek Krivka; Alexander Meduna; Benedek Nagy (Acta Informatica, 2022)

Conclusive Tree-Controlled Grammars. - Dominika Klobucníková; Zbynek Krivka; Alexander Meduna (NCMA, 2022)

Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars. - Jan Hammer; Zbynek Krivka (NCMA, 2022)

CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. - Jakub Martisko; Alexander Meduna; Zbynek Krivka (Int. J. Found. Comput. Sci., 2022)

Final Sentential Forms. - Tomás Kozár; Zbynek Krivka; Alexander Meduna (NCMA, 2023)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars. - Martin Havel; Zbynek Krivka; Alexander Meduna (NCMA, 2024)

Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals Are Computationally Complete. - Martin Havel; Alexander Meduna; Zbynek Krivka (DCFS, 2025)

Input-Erasing Two-Way Finite Automata. - Alexander Meduna; Dominik Nejedlý; Zbynek Krivka (CoRR, 2025)

Orchestration of Music by Grammar Systems. - Jozef Makis; Alexander Meduna; Zbynek Krivka (NCMA, 2025)