Alexander Meduna

ORCID

Publication Activity (10 Years)

Years Active: 1986-2023
Publications (10 Years): 18

Top Venues

NCMA

Int. J. Found. Comput. Sci.

Fundam. Informaticae

Theor. Comput. Sci.

Publications

Tomás Kozár, Zbynek Krivka, Alexander Meduna
Final Sentential Forms. NCMA (2023)
Radim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy
A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model. Acta Informatica 59 (5) (2022)
Alexander Meduna, Martin Havel
On Elimination of Erasing Rules from E0S Grammars. Comput. Sci. J. Moldova 30 (2) (2022)
Jakub Martisko, Alexander Meduna, Zbynek Krivka
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. Int. J. Found. Comput. Sci. 33 (3&4) (2022)
Dominika Klobucníková, Zbynek Krivka, Alexander Meduna
Conclusive Tree-Controlled Grammars. NCMA (2022)
Zbynek Krivka, Alexander Meduna
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete. Fundam. Informaticae 179 (4) (2021)
Radim Kocman, Zbynek Krivka, Alexander Meduna
General CD Grammar Systems and Their Simplification. J. Autom. Lang. Comb. 25 (1) (2020)
Alexander Meduna, Radim Krcmár, Adam Kövári, Zuzana Benícková
On Operations over Language Families. Comput. Sci. J. Moldova 27 (3) (2019)
Zbynek Krivka, Jirí Kucera, Alexander Meduna
Jumping Pure Grammars. Comput. J. 62 (1) (2019)
Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna
A jumping 5' → 3' Watson-Crick finite automata model. NCMA (2018)
Radim Kocman, Zbynek Krivka, Alexander Meduna
On double-jumping finite automata and their closure properties. RAIRO Theor. Informatics Appl. 52 (2-3-4) (2018)
Alexander Meduna, Ondrej Soukup, Erzsébet Csuhaj-Varjú
On tree-restricted regular-controlled context-free grammars. Int. J. Comput. Math. Comput. Syst. Theory 2 (4) (2017)
Alexander Meduna, Jakub Martisko
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. AFL (2017)
Alexander Meduna, Ondrej Soukup
Jumping Scattered Context Grammars. Fundam. Informaticae 152 (1) (2017)
Radim Kocman, Zbynek Krivka, Alexander Meduna
On double-jumping finite automata. NCMA (2016)
Zbynek Krivka, Alexander Meduna, Petr Zemek
Phrase-Structure Grammars: Normal Forms and Reduction. Comput. J. 59 (8) (2016)
Alexander Meduna, Ondrej Soukup
Simple Matrix Grammars and Their Leftmost Variants. Int. J. Found. Comput. Sci. 27 (3) (2016)
Alexander Meduna, Ondrej Soukup
Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]". Int. J. Found. Comput. Sci. 27 (5) (2016)
Zbynek Krivka, Alexander Meduna
Jumping Grammars. Int. J. Found. Comput. Sci. 26 (6) (2015)
Alexander Meduna, Lukás Vrábel, Petr Zemek
Solutions to four open problems concerning controlled pure grammar systems. Int. J. Comput. Math. 91 (6) (2014)
Zbynek Krivka, Carlos Martín-Vide, Alexander Meduna, K. G. Subramanian
A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages. IWCIA (2014)
Alexander Meduna, Petr Zemek
Controlled finite automata. Acta Informatica 51 (5) (2014)
Alexander Meduna, Petr Zemek
One-Sided Random Context Grammars: A Survey. Computing with New Resources (2014)
Alexander Meduna, Petr Zemek
One-sided random context grammars with a limited number of right random context rules. Theor. Comput. Sci. 516 (2014)
Alexander Meduna, Petr Zemek
Left Random Context ET0L Grammars. Fundam. Informaticae 123 (3) (2013)
Alexander Meduna, Petr Zemek
On the generation of sentences with their parses by propagating regular-controlled grammars. Theor. Comput. Sci. 477 (2013)
Alexander Meduna, Petr Zemek
Generalized one-sided forbidding grammars. Int. J. Comput. Math. 90 (2) (2013)
Alexander Meduna, Petr Zemek
Nonterminal complexity of one-sided random context grammars. Acta Informatica 49 (2) (2012)
Alexander Meduna, Petr Zemek
Jumping Finite Automata. Int. J. Found. Comput. Sci. 23 (7) (2012)
Alexander Meduna, Petr Zemek
One-sided forbidding grammars and selective substitution grammars. Int. J. Comput. Math. 89 (5) (2012)
Alexander Meduna, Petr Zemek
One-Sided Random Context Grammars with Leftmost Derivations. Languages Alive (2012)
Alexander Meduna, Lukás Vrábel, Petr Zemek
An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. DCFS (2012)
Alexander Meduna, Petr Zemek
Controlled Pure Grammar Systems. J. Univers. Comput. Sci. 18 (14) (2012)
Jirí Koutný, Alexander Meduna
Tree-controlled grammars with restrictions placed upon cuts and paths. Kybernetika 48 (1) (2012)
Alexander Meduna, Petr Zemek
Workspace theorems for regular-controlled grammars. Theor. Comput. Sci. 412 (35) (2011)
Alexander Meduna, Lukás Vrábel, Petr Zemek
On Nondeterminism in Programmed Grammars. AFL (2011)
Martin Cermák, Alexander Meduna
n-Accepting Restricted Pushdown Automata Systems. AFL (2011)
Alexander Meduna, Petr Zemek
One-sided random context grammars. Acta Informatica 48 (3) (2011)
Lukás Durfina, Jakub Kroustek, Petr Zemek, Dusan Kolár, Tomás Hruska, Karel Masarík, Alexander Meduna
Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. ISA (2011)
Filip Goldefus, Tomás Masopust, Alexander Meduna
Left-forbidding cooperating distributed grammar systems. Theor. Comput. Sci. 411 (40-42) (2010)
Roman Lukás, Alexander Meduna
Multigenerative grammar systems and matrix grammars. Kybernetika 46 (1) (2010)
Tomás Masopust, Alexander Meduna
Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement DCFS (2009)
Tomás Masopust, Alexander Meduna
On context-free rewriting with a simple restriction and its computational completeness. RAIRO Theor. Informatics Appl. 43 (2) (2009)
Tomás Masopust, Alexander Meduna
On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybern. 19 (2) (2009)
Alexander Meduna, Jirí Techet
An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations. Theor. Comput. Sci. 410 (21-23) (2009)
Tomás Masopust, Alexander Meduna
On Descriptional Complexity of Partially Parallel Grammars. Fundam. Informaticae 87 (3-4) (2008)
Alexander Meduna, Jirí Techet
-limited way. Acta Informatica 45 (7-8) (2008)
Tomás Masopust, Alexander Meduna
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. AFL (2008)
Tomás Masopust, Alexander Meduna, Jirí Simácek
Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybern. 18 (4) (2008)
Tomás Masopust, Alexander Meduna
Descriptional Complexity of Generalized Forbidding Grammars. DCFS (2007)
Alexander Meduna, Martin Svec, Tomás Kopecek
Obituary for David John Evans (1928-2005). Int. J. Comput. Math. 84 (11) (2007)
Alexander Meduna, Jirí Techet
Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. DCFS (2007)
Alexander Meduna, Jirí Techet
Canonical scattered context generators of sentences with their parses. Theor. Comput. Sci. 389 (1-2) (2007)
Tomás Masopust, Alexander Meduna
Descriptional Complexity of Grammars Regulated by Context Conditions. LATA (2007)
Alexander Meduna, Tomás Masopust
Self-Regulating Finite Automata. Acta Cybern. 18 (1) (2007)
Zbynek Krivka, Alexander Meduna
Generalized #-Rewriting Systems of Finite Index. Workshop on Formal Models (2007)
Tomás Masopust, Alexander Meduna
Descriptional complexity of semi-conditional grammars. Inf. Process. Lett. 104 (1) (2007)
Petr Blatný, Radek Bidlo, Alexander Meduna
Automata with two-sided pushdowns defined over free groups generated by reduced alphabets. Kybernetika 43 (3) (2007)
Radek Bidlo, Petr Blatný, Alexander Meduna
On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy. Workshop on Formal Models (2007)
Alexander Meduna, Jirí Techet
Maximal and Minimal Scattered Context Rewriting. FCT (2007)
Roman Lukás, Alexander Meduna
General Multigenerative Grammar Systems. Workshop on Formal Models (2007)
Zbynek Krivka, Alexander Meduna, Rudolf Schönecker
Generation of Languages by Rewriting Systems that Resemble Automata. Int. J. Found. Comput. Sci. 17 (5) (2006)
Alexander Meduna
Deep pushdown automata. Acta Informatica 42 (8-9) (2006)
Alexander Meduna, Jirí Techet
Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybern. 17 (1) (2005)
Alexander Meduna, Lubos Lorenc
Self-reproducing pushdown transducers. Kybernetika 41 (4) (2005)
Alexander Meduna, Tomás Kopecek
Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Comput. Artif. Intell. 23 (3) (2004)
Alexander Meduna
Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. Acta Cybern. 16 (3) (2004)
Alexander Meduna
Erratum: Coincidental extension of scattered context languages. Acta Informatica 39 (9) (2003)
Henning Fernau, Alexander Meduna
On the degree of scattered context-sensitivity. Theor. Comput. Sci. 290 (3) (2003)
Alexander Meduna, Martin Svec
Forbidding ET0L grammars. Theor. Comput. Sci. 306 (1-3) (2003)
Alexander Meduna, Martin Svec
Descriptional Complexity of Generalized Forbidding Grammars. Int. J. Comput. Math. 80 (1) (2003)
Henning Fernau, Alexander Meduna
A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Inf. Process. Lett. 86 (5) (2003)
Alexander Meduna
Coincidental extension of scattered context languages. Acta Informatica 39 (5) (2003)
Alexander Meduna, Dusan Kolár
Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals. Grammars and Automata for String Processing (2003)
Alexander Meduna
Simultaneously One-Turn Two-Pushdown Automata. Int. J. Comput. Math. 80 (6) (2003)
Alexander Meduna, Martin Svec
Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. Acta Cybern. 15 (3) (2002)
Alexander Meduna
Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. J. Autom. Lang. Comb. 7 (4) (2002)
Alexander Meduna, Duwan Koláq
One-Turn Regulated Pushdown Automata and Their Reduction. Fundam. Informaticae 51 (4) (2002)
Alexander Meduna, Dusan Kolár
Homogeneous grammars with a reduced number of non-context-free productions. Inf. Process. Lett. 81 (5) (2002)
Alexander Meduna
Descriptional Complexity of Partially Parallel Grammars. DCFS (2001)
Alexander Meduna, Petr Vurm
Multisequential Grammars with Homogeneous Selectors. Fundam. Informaticae 48 (1) (2001)
Alexander Meduna
Uniform Generation of Languages by Scattered Context Grammars. Fundam. Informaticae 45 (3) (2001)
Alexander Meduna
Generative power of three-nonterminal scattered context grammars. Theor. Comput. Sci. 246 (1-2) (2000)
Alexander Meduna
Terminating left-hand sides of scattered context productions M. Nivat. Theor. Comput. Sci. 237 (1-2) (2000)
Alexander Meduna, Dusan Kolár
Regulated Pushdown Automata. Acta Cybern. 14 (4) (2000)
Alexander Meduna
Middle quotients of linear languages. Int. J. Comput. Math. 71 (3) (1999)
Alexander Meduna
Prefix pushdown automata and their simplification. Int. J. Comput. Math. 71 (1) (1999)
Alexander Meduna
Uniform rewriting based on permutations. Int. J. Comput. Math. 69 (1-2) (1998)
Alexander Meduna
Descriptional Complexity of Multi-Continuous Grammars. Acta Cybern. 13 (4) (1998)
Alexander Meduna
Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars. Acta Cybern. 13 (3) (1998)
Alexander Meduna
Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages. Int. J. Comput. Math. 63 (1-2) (1997)
Alexander Meduna
Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages. Int. J. Comput. Math. 65 (3-4) (1997)
Alexander Meduna
On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. New Trends in Formal Languages (1997)
Alexander Meduna
Syntactic Complexity of Context-Free Grammars Over Word Monoids. Acta Informatica 33 (5) (1996)
Alexander Meduna
A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars. Bull. EATCS 56 (1995)
Alexander Meduna
Syntactic Complexity of Scattered Context Grammars. Acta Informatica 32 (3) (1995)
Erzsébet Csuhaj-Varjú, Alexander Meduna
Grammars without context conditions. Bull. EATCS 53 (1994)
Alexander Meduna, A. Gopalaratnam
On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. Acta Cybern. 11 (4) (1994)
Alexander Meduna, Cynthia J. Crooks, Milan Sárek
Syntactic complexity of regulated rewriting. Kybernetika 30 (2) (1994)
Alexander Meduna
Symbiotic EOL Systems. Acta Cybern. 10 (3) (1992)

Alexander Meduna.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alexander Meduna