A note on exponential density of ETOL languages. - Alexander Meduna (Kybernetika, 1986)

Evaluated grammars. - Alexander Meduna (Acta Cybern., 1987)

On state grammars. - Alexander Meduna; Gy. Horváth (Acta Cybern., 1988)

Context Free Derivations on Word Monoids. - Alexander Meduna (Acta Informatica, 1990)

Generalized forbidding grammars. - Alexander Meduna (Int. J. Comput. Math., 1990)

Global Context Conditional Grammars. - Alexander Meduna (J. Inf. Process. Cybern., 1991)

Symbiotic EOL Systems. - Alexander Meduna (Acta Cybern., 1992)

On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. - Alexander Meduna; A. Gopalaratnam (Acta Cybern., 1994)

Grammars without context conditions. - Erzsébet Csuhaj-Varjú; Alexander Meduna (Bull. EATCS, 1994)

Syntactic complexity of regulated rewriting. - Alexander Meduna; Cynthia J. Crooks; Milan Sárek (Kybernetika, 1994)

Syntactic Complexity of Scattered Context Grammars. - Alexander Meduna (Acta Informatica, 1995)

A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars. - Alexander Meduna (Bull. EATCS, 1995)

Syntactic Complexity of Context-Free Grammars Over Word Monoids. - Alexander Meduna (Acta Informatica, 1996)

On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. - Alexander Meduna (New Trends in Formal Languages, 1997)

Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages. - Alexander Meduna (Int. J. Comput. Math., 1997)

Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages. - Alexander Meduna (Int. J. Comput. Math., 1997)

Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars. - Alexander Meduna (Acta Cybern., 1998)

Descriptional Complexity of Multi-Continuous Grammars. - Alexander Meduna (Acta Cybern., 1998)

Uniform rewriting based on permutations. - Alexander Meduna (Int. J. Comput. Math., 1998)

Prefix pushdown automata and their simplification. - Alexander Meduna (Int. J. Comput. Math., 1999)

Middle quotients of linear languages. - Alexander Meduna (Int. J. Comput. Math., 1999)

Automata and languages - theory and applications. - Alexander Meduna (Springer, 2000)

Regulated Pushdown Automata. - Alexander Meduna; Dusan Kolár (Acta Cybern., 2000)

Terminating left-hand sides of scattered context productions M. Nivat. - Alexander Meduna (Theor. Comput. Sci., 2000)

Generative power of three-nonterminal scattered context grammars. - Alexander Meduna (Theor. Comput. Sci., 2000)

Descriptional Complexity of Partially Parallel Grammars. - Alexander Meduna (DCFS, 2001)

Uniform Generation of Languages by Scattered Context Grammars. - Alexander Meduna (Fundam. Informaticae, 2001)

Multisequential Grammars with Homogeneous Selectors. - Alexander Meduna; Petr Vurm (Fundam. Informaticae, 2001)

Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. - Alexander Meduna; Martin Svec (Acta Cybern., 2002)

One-Turn Regulated Pushdown Automata and Their Reduction. - Alexander Meduna; Duwan Koláq (Fundam. Informaticae, 2002)

Homogeneous grammars with a reduced number of non-context-free productions. - Alexander Meduna; Dusan Kolár (Inf. Process. Lett., 2002)

Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. - Alexander Meduna (J. Autom. Lang. Comb., 2002)

Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals. - Alexander Meduna; Dusan Kolár (Grammars and Automata for String Processing, 2003)

Coincidental extension of scattered context languages. - Alexander Meduna (Acta Informatica, 2003)

Erratum: Coincidental extension of scattered context languages. - Alexander Meduna (Acta Informatica, 2003)

Simultaneously One-Turn Two-Pushdown Automata. - Alexander Meduna (Int. J. Comput. Math., 2003)

Descriptional Complexity of Generalized Forbidding Grammars. - Alexander Meduna; Martin Svec (Int. J. Comput. Math., 2003)

A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. - Henning Fernau; Alexander Meduna (Inf. Process. Lett., 2003)

On the degree of scattered context-sensitivity. - Henning Fernau; Alexander Meduna (Theor. Comput. Sci., 2003)

Forbidding ET0L grammars. - Alexander Meduna; Martin Svec (Theor. Comput. Sci., 2003)

Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. - Alexander Meduna (Acta Cybern., 2004)

Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. - Alexander Meduna; Tomás Kopecek (Comput. Artif. Intell., 2004)

Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. - Alexander Meduna; Jirí Techet (Acta Cybern., 2005)

Self-reproducing pushdown transducers. - Alexander Meduna; Lubos Lorenc (Kybernetika, 2005)

Deep pushdown automata. - Alexander Meduna (Acta Informatica, 2006)

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

Descriptional Complexity of Generalized Forbidding Grammars. - Tomás Masopust; Alexander Meduna (DCFS, 2007)

Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. - Alexander Meduna; Jirí Techet (DCFS, 2007)

Maximal and Minimal Scattered Context Rewriting. - Alexander Meduna; Jirí Techet (FCT, 2007)

On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy. - Radek Bidlo; Petr Blatný; Alexander Meduna (Workshop on Formal Models, 2007)

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

General Multigenerative Grammar Systems. - Roman Lukás; Alexander Meduna (Workshop on Formal Models, 2007)

Descriptional Complexity of Grammars Regulated by Context Conditions. - Tomás Masopust; Alexander Meduna (LATA, 2007)

Self-Regulating Finite Automata. - Alexander Meduna; Tomás Masopust (Acta Cybern., 2007)

Obituary for David John Evans (1928-2005). - Alexander Meduna; Martin Svec; Tomás Kopecek (Int. J. Comput. Math., 2007)

Descriptional complexity of semi-conditional grammars. - Tomás Masopust; Alexander Meduna (Inf. Process. Lett., 2007)

Automata with two-sided pushdowns defined over free groups generated by reduced alphabets. - Petr Blatný; Radek Bidlo; Alexander Meduna (Kybernetika, 2007)

Canonical scattered context generators of sentences with their parses. - Alexander Meduna; Jirí Techet (Theor. Comput. Sci., 2007)

Scattered context grammars that erase nonterminals in a generalized k -limited way. - Alexander Meduna; Jirí Techet (Acta Informatica, 2008)

Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. - Tomás Masopust; Alexander Meduna; Jirí Simácek (Acta Cybern., 2008)

On Descriptional Complexity of Partially Parallel Grammars. - Tomás Masopust; Alexander Meduna (Fundam. Informaticae, 2008)

On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. - Tomás Masopust; Alexander Meduna (Acta Cybern., 2009)

Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement - Tomás Masopust; Alexander Meduna (DCFS, 2009)

On context-free rewriting with a simple restriction and its computational completeness. - Tomás Masopust; Alexander Meduna (RAIRO Theor. Informatics Appl., 2009)

An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations. - Alexander Meduna; Jirí Techet (Theor. Comput. Sci., 2009)

Multigenerative grammar systems and matrix grammars. - Roman Lukás; Alexander Meduna (Kybernetika, 2010)

Left-forbidding cooperating distributed grammar systems. - Filip Goldefus; Tomás Masopust; Alexander Meduna (Theor. Comput. Sci., 2010)

n-Accepting Restricted Pushdown Automata Systems. - Martin Cermák; Alexander Meduna (AFL, 2011)

On Nondeterminism in Programmed Grammars. - Alexander Meduna; Lukás Vrábel; Petr Zemek (AFL, 2011)

Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. - Lukás Durfina; Jakub Kroustek; Petr Zemek; Dusan Kolár; Tomás Hruska; Karel Masarík; Alexander Meduna (ISA, 2011)

One-sided random context grammars. - Alexander Meduna; Petr Zemek (Acta Informatica, 2011)

Workspace theorems for regular-controlled grammars. - Alexander Meduna; Petr Zemek (Theor. Comput. Sci., 2011)

One-Sided Random Context Grammars with Leftmost Derivations. - Alexander Meduna; Petr Zemek (Languages Alive, 2012)

An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. - Alexander Meduna; Lukás Vrábel; Petr Zemek (DCFS, 2012)

Nonterminal complexity of one-sided random context grammars. - Alexander Meduna; Petr Zemek (Acta Informatica, 2012)

One-sided forbidding grammars and selective substitution grammars. - Alexander Meduna; Petr Zemek (Int. J. Comput. Math., 2012)

Jumping Finite Automata. - Alexander Meduna; Petr Zemek (Int. J. Found. Comput. Sci., 2012)

Controlled Pure Grammar Systems. - Alexander Meduna; Petr Zemek (J. Univers. Comput. Sci., 2012)

Tree-controlled grammars with restrictions placed upon cuts and paths. - Jirí Koutný; Alexander Meduna (Kybernetika, 2012)

Left Random Context ET0L Grammars. - Alexander Meduna; Petr Zemek (Fundam. Informaticae, 2013)

Generalized one-sided forbidding grammars. - Alexander Meduna; Petr Zemek (Int. J. Comput. Math., 2013)

On the generation of sentences with their parses by propagating regular-controlled grammars. - Alexander Meduna; Petr Zemek (Theor. Comput. Sci., 2013)

Regulated Grammars and Automata - Alexander Meduna; Petr Zemek (Springer, 2014)

One-Sided Random Context Grammars: A Survey. - Alexander Meduna; Petr Zemek (Computing with New Resources, 2014)

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)

Controlled finite automata. - Alexander Meduna; Petr Zemek (Acta Informatica, 2014)

Solutions to four open problems concerning controlled pure grammar systems. - Alexander Meduna; Lukás Vrábel; Petr Zemek (Int. J. Comput. Math., 2014)

One-sided random context grammars with a limited number of right random context rules. - Alexander Meduna; Petr Zemek (Theor. Comput. Sci., 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)

Simple Matrix Grammars and Their Leftmost Variants. - Alexander Meduna; Ondrej Soukup (Int. J. Found. Comput. Sci., 2016)

Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]". - Alexander Meduna; Ondrej Soukup (Int. J. Found. Comput. Sci., 2016)

Modern Language Models and Computation - Theory with Applications - Alexander Meduna; Ondrej Soukup (Springer, 2017)

CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. - Alexander Meduna; Jakub Martisko (AFL, 2017)

Jumping Scattered Context Grammars. - Alexander Meduna; Ondrej Soukup (Fundam. Informaticae, 2017)

On tree-restricted regular-controlled context-free grammars. - Alexander Meduna; Ondrej Soukup; Erzsébet Csuhaj-Varjú (Int. J. Comput. Math. Comput. Syst. Theory, 2017)

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)

On Operations over Language Families. - Alexander Meduna; Radim Krcmár; Adam Kövári; Zuzana Benícková (Comput. Sci. J. Moldova, 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)

Multi-island finite automata and their even computation. - Dusan Kolár; Alexander Meduna; Martin Tomko (Kybernetika, 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)

On Elimination of Erasing Rules from E0S Grammars. - Alexander Meduna; Martin Havel (Comput. Sci. J. Moldova, 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)

Automata - Theory, Trends, and Applications - Alexander Meduna; Tomás Kozár (Automata, 2023)

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)