Alexander Meduna

118 papers B 1C 2Journal 85Unranked 25

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Centralized Versions of Jumping Finite Automata. Languages of Cooperation and Communication Alexander Meduna, Zdenek Foltýn
2025	J	`jnl`	Input-Erasing Two-Way Finite Automata. CoRR Alexander Meduna, Dominik Nejedlý, Zbynek Krivka
2025	—	`conf`	Orchestration of Music by Grammar Systems. NCMA Jozef Makis, Alexander Meduna, Zbynek Krivka
2025	—	`conf`	Scattered Context Grammars with One Non-Context-Free Production and Six Nonterminals Are Computationally Complete. DCFS Martin Havel, Alexander Meduna, Zbynek Krivka
2025	J	`jnl`	The Dimensions API: a domain specific language for scientometrics research. Frontiers Res. Metrics Anal. Adam Kövári, Michele Pasin, Alexander Meduna
2024	—	`conf`	How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars. NCMA Martin Havel, Zbynek Krivka, Alexander Meduna
2023	—	`book`	Automata - Theory, Trends, and Applications Automata Alexander Meduna, Tomás Kozár
2023	—	`conf`	Final Sentential Forms. NCMA Tomás Kozár, Zbynek Krivka, Alexander Meduna
2022	J	`jnl`	A jumping $5'\rightarrow 3'$ Watson-Crick finite automata model. Acta Informatica Radim Kocman, Zbynek Krivka, Alexander Meduna, Benedek Nagy
2022	J	`jnl`	CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. Int. J. Found. Comput. Sci. Jakub Martisko, Alexander Meduna, Zbynek Krivka
2022	—	`conf`	Conclusive Tree-Controlled Grammars. NCMA Dominika Klobucníková, Zbynek Krivka, Alexander Meduna
2022	J	`jnl`	On Elimination of Erasing Rules from E0S Grammars. Comput. Sci. J. Moldova Alexander Meduna, Martin Havel
2021	J	`jnl`	Multi-island finite automata and their even computation. Kybernetika Dusan Kolár, Alexander Meduna, Martin Tomko
2021	J	`jnl`	Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete. Fundam. Informaticae Zbynek Krivka, Alexander Meduna
2020	J	`jnl`	General CD Grammar Systems and Their Simplification. J. Autom. Lang. Comb. Radim Kocman, Zbynek Krivka, Alexander Meduna
2019	J	`jnl`	Jumping Pure Grammars. Comput. J. Zbynek Krivka, Jirí Kucera, Alexander Meduna
2019	J	`jnl`	On Operations over Language Families. Comput. Sci. J. Moldova Alexander Meduna, Radim Krcmár, Adam Kövári, Zuzana Benícková
2018	—	`conf`	A jumping 5' → 3' Watson-Crick finite automata model. NCMA Radim Kocman, Benedek Nagy, Zbynek Krivka, Alexander Meduna
2018	J	`jnl`	On double-jumping finite automata and their closure properties. RAIRO Theor. Informatics Appl. Radim Kocman, Zbynek Krivka, Alexander Meduna
2017	—	`conf`	CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. AFL Alexander Meduna, Jakub Martisko
2017	J	`jnl`	Jumping Scattered Context Grammars. Fundam. Informaticae Alexander Meduna, Ondrej Soukup
2017	—	`book`	Modern Language Models and Computation - Theory with Applications Alexander Meduna, Ondrej Soukup
2017	J	`jnl`	On tree-restricted regular-controlled context-free grammars. Int. J. Comput. Math. Comput. Syst. Theory Alexander Meduna, Ondrej Soukup, Erzsébet Csuhaj-Varjú
2016	J	`jnl`	Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3]". Int. J. Found. Comput. Sci. Alexander Meduna, Ondrej Soukup
2016	—	`conf`	On double-jumping finite automata. NCMA Radim Kocman, Zbynek Krivka, Alexander Meduna
2016	J	`jnl`	Phrase-Structure Grammars: Normal Forms and Reduction. Comput. J. Zbynek Krivka, Alexander Meduna, Petr Zemek
2016	J	`jnl`	Simple Matrix Grammars and Their Leftmost Variants. Int. J. Found. Comput. Sci. Alexander Meduna, Ondrej Soukup
2015	J	`jnl`	Jumping Grammars. Int. J. Found. Comput. Sci. Zbynek Krivka, Alexander Meduna
2014	C	`conf`	A Variant of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages. IWCIA Zbynek Krivka, Carlos Martín-Vide, Alexander Meduna, K. G. Subramanian
2014	J	`jnl`	Controlled finite automata. Acta Informatica Alexander Meduna, Petr Zemek
2014	—	`conf`	One-Sided Random Context Grammars: A Survey. Computing with New Resources Alexander Meduna, Petr Zemek
2014	J	`jnl`	One-sided random context grammars with a limited number of right random context rules. Theor. Comput. Sci. Alexander Meduna, Petr Zemek
2014	—	`book`	Regulated Grammars and Automata Alexander Meduna, Petr Zemek
2014	J	`jnl`	Solutions to four open problems concerning controlled pure grammar systems. Int. J. Comput. Math. Alexander Meduna, Lukás Vrábel, Petr Zemek
2013	J	`jnl`	Generalized one-sided forbidding grammars. Int. J. Comput. Math. Alexander Meduna, Petr Zemek
2013	J	`jnl`	Left Random Context ET0L Grammars. Fundam. Informaticae Alexander Meduna, Petr Zemek
2013	J	`jnl`	On the generation of sentences with their parses by propagating regular-controlled grammars. Theor. Comput. Sci. Alexander Meduna, Petr Zemek
2012	—	`conf`	An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. DCFS Alexander Meduna, Lukás Vrábel, Petr Zemek
2012	J	`jnl`	Controlled Pure Grammar Systems. J. Univers. Comput. Sci. Alexander Meduna, Petr Zemek
2012	J	`jnl`	Jumping Finite Automata. Int. J. Found. Comput. Sci. Alexander Meduna, Petr Zemek
2012	J	`jnl`	Nonterminal complexity of one-sided random context grammars. Acta Informatica Alexander Meduna, Petr Zemek
2012	—	`conf`	One-Sided Random Context Grammars with Leftmost Derivations. Languages Alive Alexander Meduna, Petr Zemek
2012	J	`jnl`	One-sided forbidding grammars and selective substitution grammars. Int. J. Comput. Math. Alexander Meduna, Petr Zemek
2012	J	`jnl`	Tree-controlled grammars with restrictions placed upon cuts and paths. Kybernetika Jirí Koutný, Alexander Meduna
2011	—	`conf`	Design of a Retargetable Decompiler for a Static Platform-Independent Malware Analysis. ISA Lukás Durfina, Jakub Kroustek, Petr Zemek, Dusan Kolár, Tomás Hruska, Karel Masarík, Alexander Meduna
2011	—	`conf`	On Nondeterminism in Programmed Grammars. AFL Alexander Meduna, Lukás Vrábel, Petr Zemek
2011	J	`jnl`	One-sided random context grammars. Acta Informatica Alexander Meduna, Petr Zemek
2011	J	`jnl`	Workspace theorems for regular-controlled grammars. Theor. Comput. Sci. Alexander Meduna, Petr Zemek
2011	—	`conf`	n-Accepting Restricted Pushdown Automata Systems. AFL Martin Cermák, Alexander Meduna
2010	J	`jnl`	Left-forbidding cooperating distributed grammar systems. Theor. Comput. Sci. Filip Goldefus, Tomás Masopust, Alexander Meduna
2010	J	`jnl`	Multigenerative grammar systems and matrix grammars. Kybernetika Roman Lukás, Alexander Meduna
2009	J	`jnl`	An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations. Theor. Comput. Sci. Alexander Meduna, Jirí Techet
2009	—	`conf`	Descriptional Complexity of Three-Nonterminal Scattered Context Grammars: An Improvement DCFS Tomás Masopust, Alexander Meduna
2009	J	`jnl`	On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. Acta Cybern. Tomás Masopust, Alexander Meduna
2009	J	`jnl`	On context-free rewriting with a simple restriction and its computational completeness. RAIRO Theor. Informatics Appl. Tomás Masopust, Alexander Meduna
2008	J	`jnl`	On Descriptional Complexity of Partially Parallel Grammars. Fundam. Informaticae Tomás Masopust, Alexander Meduna
2008	—	`conf`	On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops. AFL Tomás Masopust, Alexander Meduna
2008	J	`jnl`	Scattered context grammars that erase nonterminals in a generalized Acta Informatica Alexander Meduna, Jirí Techet
2008	J	`jnl`	Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. Acta Cybern. Tomás Masopust, Alexander Meduna, Jirí Simácek
2007	J	`jnl`	Automata with two-sided pushdowns defined over free groups generated by reduced alphabets. Kybernetika Petr Blatný, Radek Bidlo, Alexander Meduna
2007	J	`jnl`	Canonical scattered context generators of sentences with their parses. Theor. Comput. Sci. Alexander Meduna, Jirí Techet
2007	—	`conf`	Descriptional Complexity of Generalized Forbidding Grammars. DCFS Tomás Masopust, Alexander Meduna
2007	C	`conf`	Descriptional Complexity of Grammars Regulated by Context Conditions. LATA Tomás Masopust, Alexander Meduna
2007	J	`jnl`	Descriptional complexity of semi-conditional grammars. Inf. Process. Lett. Tomás Masopust, Alexander Meduna
2007	—	`conf`	General Multigenerative Grammar Systems. Workshop on Formal Models Roman Lukás, Alexander Meduna
2007	—	`conf`	Generalized #-Rewriting Systems of Finite Index. Workshop on Formal Models Zbynek Krivka, Alexander Meduna
2007	B	`conf`	Maximal and Minimal Scattered Context Rewriting. FCT Alexander Meduna, Jirí Techet
2007	J	`jnl`	Obituary for David John Evans (1928-2005). Int. J. Comput. Math. Alexander Meduna, Martin Svec, Tomás Kopecek
2007	—	`conf`	On Vertical Grammatical Restrictions that Produce an Infinite Language Hierarchy. Workshop on Formal Models Radek Bidlo, Petr Blatný, Alexander Meduna
2007	—	`ed.`	Proceedings of the 2nd International Workshop on Formal Models WFM'07, Hradec nad Moravicí, Czech Republic, April 23-25, 2007 WFM Alica Kelemenová, Dusan Kolár, Alexander Meduna
2007	—	`conf`	Reduction of Scattered Context Generators of Sentences Preceded by Their Leftmost Parses. DCFS Alexander Meduna, Jirí Techet
2007	J	`jnl`	Self-Regulating Finite Automata. Acta Cybern. Alexander Meduna, Tomás Masopust
2006	J	`jnl`	Deep pushdown automata. Acta Informatica Alexander Meduna
2006	J	`jnl`	Generation of Languages by Rewriting Systems that Resemble Automata. Int. J. Found. Comput. Sci. Zbynek Krivka, Alexander Meduna, Rudolf Schönecker
2005	J	`jnl`	Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. Acta Cybern. Alexander Meduna, Jirí Techet
2005	J	`jnl`	Self-reproducing pushdown transducers. Kybernetika Alexander Meduna, Lubos Lorenc
2004	J	`jnl`	Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. Comput. Artif. Intell. Alexander Meduna, Tomás Kopecek
2004	J	`jnl`	Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. Acta Cybern. Alexander Meduna
2003	J	`jnl`	A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Inf. Process. Lett. Henning Fernau, Alexander Meduna
2003	J	`jnl`	Coincidental extension of scattered context languages. Acta Informatica Alexander Meduna
2003	J	`jnl`	Descriptional Complexity of Generalized Forbidding Grammars. Int. J. Comput. Math. Alexander Meduna, Martin Svec
2003	—	`conf`	Descriptional Complexity of Multi-Parallel Grammars with Respect to the Number of Nonterminals. Grammars and Automata for String Processing Alexander Meduna, Dusan Kolár
2003	J	`jnl`	Erratum: Coincidental extension of scattered context languages. Acta Informatica Alexander Meduna
2003	J	`jnl`	Forbidding ET0L grammars. Theor. Comput. Sci. Alexander Meduna, Martin Svec
2003	J	`jnl`	On the degree of scattered context-sensitivity. Theor. Comput. Sci. Henning Fernau, Alexander Meduna
2003	J	`jnl`	Simultaneously One-Turn Two-Pushdown Automata. Int. J. Comput. Math. Alexander Meduna
2002	J	`jnl`	Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. J. Autom. Lang. Comb. Alexander Meduna
2002	J	`jnl`	Homogeneous grammars with a reduced number of non-context-free productions. Inf. Process. Lett. Alexander Meduna, Dusan Kolár
2002	J	`jnl`	One-Turn Regulated Pushdown Automata and Their Reduction. Fundam. Informaticae Alexander Meduna, Duwan Koláq
2002	J	`jnl`	Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. Acta Cybern. Alexander Meduna, Martin Svec
2001	—	`conf`	Descriptional Complexity of Partially Parallel Grammars. DCFS Alexander Meduna
2001	J	`jnl`	Multisequential Grammars with Homogeneous Selectors. Fundam. Informaticae Alexander Meduna, Petr Vurm
2001	J	`jnl`	Uniform Generation of Languages by Scattered Context Grammars. Fundam. Informaticae Alexander Meduna
2000	—	`book`	Automata and languages - theory and applications. Alexander Meduna
2000	J	`jnl`	Generative power of three-nonterminal scattered context grammars. Theor. Comput. Sci. Alexander Meduna
2000	J	`jnl`	Regulated Pushdown Automata. Acta Cybern. Alexander Meduna, Dusan Kolár
2000	J	`jnl`	Terminating left-hand sides of scattered context productions M. Nivat. Theor. Comput. Sci. Alexander Meduna
1999	J	`jnl`	Middle quotients of linear languages. Int. J. Comput. Math. Alexander Meduna
1999	J	`jnl`	Prefix pushdown automata and their simplification. Int. J. Comput. Math. Alexander Meduna
1998	J	`jnl`	Descriptional Complexity of Multi-Continuous Grammars. Acta Cybern. Alexander Meduna
1998	J	`jnl`	Economical Transformations of Phrase-Structure Grammars to Scattered Context Grammars. Acta Cybern. Alexander Meduna
1998	J	`jnl`	Uniform rewriting based on permutations. Int. J. Comput. Math. Alexander Meduna
1997	J	`jnl`	Four-nonterminal scattered context grammars characterize the family of recursively enumerable languages. Int. J. Comput. Math. Alexander Meduna
1997	—	`conf`	On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations. New Trends in Formal Languages Alexander Meduna
1997	J	`jnl`	Six-Nonterminal multi-sequential grammars characterize the family of recursively enumerable languages. Int. J. Comput. Math. Alexander Meduna
1996	J	`jnl`	Syntactic Complexity of Context-Free Grammars Over Word Monoids. Acta Informatica Alexander Meduna
1995	J	`jnl`	A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars. Bull. EATCS Alexander Meduna
1995	J	`jnl`	Syntactic Complexity of Scattered Context Grammars. Acta Informatica Alexander Meduna
1994	J	`jnl`	Grammars without context conditions. Bull. EATCS Erzsébet Csuhaj-Varjú, Alexander Meduna
1994	J	`jnl`	On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. Acta Cybern. Alexander Meduna, A. Gopalaratnam
1994	J	`jnl`	Syntactic complexity of regulated rewriting. Kybernetika Alexander Meduna, Cynthia J. Crooks, Milan Sárek
1992	J	`jnl`	Symbiotic EOL Systems. Acta Cybern. Alexander Meduna
1991	J	`jnl`	Global Context Conditional Grammars. J. Inf. Process. Cybern. Alexander Meduna
1990	J	`jnl`	Context Free Derivations on Word Monoids. Acta Informatica Alexander Meduna
1990	J	`jnl`	Generalized forbidding grammars. Int. J. Comput. Math. Alexander Meduna
1988	J	`jnl`	On state grammars. Acta Cybern. Alexander Meduna, Gy. Horváth
1987	J	`jnl`	Evaluated grammars. Acta Cybern. Alexander Meduna
1986	J	`jnl`	A note on exponential density of ETOL languages. Kybernetika Alexander Meduna