Zbynek Krivka

According to our database, Zbynek Krivka authored at least 21 papers between 2006 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars.

Martin Havel, Zbynek Krivka, Alexander Meduna

CoRR, 2024

2023

Final Sentential Forms.

Tomás Kozár, Zbynek Krivka, Alexander Meduna

Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023

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

Practical Aspects of Membership Problem of Watson-Crick Context-free Grammars.

Jan Hammer, Zbynek Krivka

Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

Conclusive Tree-Controlled Grammars.

Dominika Klobucníková, Zbynek Krivka, Alexander Meduna

Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model.

Radim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy

Acta Informatica, 2022

2021

Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete.

Zbynek Krivka, Alexander Meduna

Fundam. Informaticae, 2021

2020

General CD Grammar Systems and Their Simplification.

Radim Kocman, Zbynek Krivka, Alexander Meduna

J. Autom. Lang. Comb., 2020

2019

Jumping Pure Grammars.

Zbynek Krivka, Jirí Kucera, Alexander Meduna

Comput. J., 2019

2018

On double-jumping finite automata and their closure properties.

Radim Kocman, Zbynek Krivka, Alexander Meduna

RAIRO Theor. Informatics Appl., 2018

A jumping 5' → 3' Watson-Crick finite automata model.

Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna

Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

2016

Phrase-Structure Grammars: Normal Forms and Reduction.

Zbynek Krivka, Alexander Meduna, Petr Zemek

Comput. J., 2016

On double-jumping finite automata.

Radim Kocman, Zbynek Krivka, Alexander Meduna

Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

2015

Jumping Grammars.

Zbynek Krivka, Alexander Meduna

Int. J. Found. Comput. Sci., 2015

2014

A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages.

Zbynek Krivka, Carlos Martín-Vide, Alexander Meduna, K. G. Subramanian

Proceedings of the Combinatorial Image Analysis - 16th International Workshop, 2014

2011

Cooperating Distributed Grammar Systems with Random Context Grammars as Components.

Zbynek Krivka, Tomás Masopust

Acta Cybern., 2011

2009

A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking.

Zbynek Krivka, Tomás Masopust

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

Design and implementation of back-end for Picoblaze C compiler.

Zbynek Krivka, Ota Jirák

Proceedings of the IADIS International Conference Applied Computing 2009, 2009

2007

A Note on the Parsing of Complete VHDL-2002.

Lubos Lorenc, Rudolf Schönecker, Zbynek Krivka

Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007

Generalized #-Rewriting Systems of Finite Index.

Zbynek Krivka, Alexander Meduna

Proceedings of the 2nd International Workshop on Formal Models WFM'07, 2007

2006

Generation of Languages by Rewriting Systems that Resemble Automata.

Zbynek Krivka, Alexander Meduna, Rudolf Schönecker

Int. J. Found. Comput. Sci., 2006