Meduna, A. [1986]. “A Note on Exponential Density of ETOL Languages,” Kybernetika 22, 514-518.
Meduna, A. [1987a]. “Characterization of the Chomsky Hierarchy through Sequential-Parallel Grammars,” Rostock. Math. Kolloq. 32, 4-14.
Meduna, A. [1987b]. “Evaluated Grammars,” Acta Cybernetika 8, 169-176.
Meduna, A. [1990a]. “Context Free Derivations on Word Monoids,” Acta Informatica 27, 781-786.
Meduna, A. [1990b]. “Generalized Forbidding Grammars,” International Journal of Computer Mathematics 36, 31-38.
Meduna, A. [1991]. “Global Context Conditional Grammars,” J. Inform. Process. Cybern. 27, 159-165.
Meduna, A. [1992]. “Symbiotic E0L Systems,” Acta Cybernetica 12, 164-172.
Meduna, A. [1993a]. “A Formalization of Sequential, Parallel, and Continuous Rewriting,” International Journal of Computer Mathematics 39, 24-32.
Meduna, A. [1993b]. “Canonical Scattered Rewriting,” International Journal of Computer Mathematics 51, 122-129.
Meduna, A. [1994]. “Matrix Grammars under Leftmost and Rightmost Restrictions,” in vol. Mathematical Linguistics and Related Topics (Gh. Paun, ed.), The Publ. House of the Romanian Academy, Bucharest, 243-257.
Meduna, A. [1995a]. “A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars,” EATCS Bulletin 56, 104-106.
Meduna, A. [1995b]. “Syntactic Complexity of Scattered Context Grammars,” Acta Informatica 32, 285-298.
Meduna, A. [1996]. “Syntactic Complexity of Context-Free Grammars over Word Monoids,” Acta Informatica 33, 457-462.
Meduna, A. [1997a]. “Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages,” International Journal of Computer Mathematics 63, 67-83.
Meduna, A. [1997b]. “On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations,” LNCS 1217, 27-38.
Meduna, A. [1997c]. “Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages,” International Journal of Computer Mathematics 65, 179-189.
Meduna, A. [1998a]. “Descriptional Complexity of Multi-Continues Grammars,” Acta Cybernetica 13, 375-384.
Meduna, A. [1998b]. “Economical Transformation of Phrase-Structure Grammars to Scattered Context Grammars,” Acta Cybernetica 13, 225-242.
Meduna, A. [1998c]. “Uniform Rewriting Based on Permutations,” International Journal of Computer Mathematics 69, 57-74.
Meduna, A. [1999a]. “Prefix Pushdown Automata,” International Journal of Computer Mathematics 71, 215-228.
Meduna, A. [1999b]. “Terminating Left-Hand Sides of Scattered Context Productions,” Theoretical Computer Science 237, 567-601.
Meduna, A. [2000a]. “Generative Power of Three-Nonterminal Scattered Context Grammars,” Theoretical Computer Science 246, 276-284.
Meduna, A. [2000b]. “Generative Power of Three-Nonterminal Scattered Context Grammars,” Theoretical Computer Science, 625-631.
Meduna, A. [2000c]. “Terminating Left-Hand Sides of Scattered Context Grammars,” Theoretical Computer Science, 423-427.
Meduna, A. [2001]. “Uniform Generation of Languages by Scattered Context Grammars,” Fundamenta Informaticae 44, 231-235.
Meduna, A. [2002]. “Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview,” Journal of Automata, Languages and Combinatorics 7, 571-577.
Meduna, A. [2003a]. “Coincidental Extention of Scattered Context Languages,” Acta Informatica 39, 307-314.
Meduna, A. [2003b]. “Simultaneously One-Turn Two-Pushdown Automata,” International Journal of Computer Mathematics 80, 679-687.
Meduna, A. [2004]. “Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity,” Acta Cybernetica 92, 126-137.
Meduna, A. and Csuhaj-Varju, E. [1993]. “Grammars with Context Conditions,” EATCS Bulletin 32, 112-124.
Meduna, A. and Fernau, H. [2003a]. “A Simultaneous Reduction of Several Measures of Descriptional Complexity in Scattered Context Grammars,” Information Processing Letters 86, 235-240.
Meduna, A. and Fernau, H. [2003b]. “On the Degree of Scattered Context-Sensitivity,” Theoretical Computer Science 290, 2121-2124.
Meduna, A. and Gopalaratnam, M. [1994]. “On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions,” Acta Cybernetica 11, 309-323.
Meduna, A. and Horvath, G. [1988]. “On State Grammars,” Acta Cybernetica 8, 237-245.
Meduna, A. and Kolář, D. [2000a]. “Descriptional complexity of multi-parallel grammars with respect to the number of nonterminals,” Grammars and Automata for String Processing from Mathematics and Computer Science to Biology, and Back, Francis and Taylor, 724-732.
Meduna, A. and Kolář, D. [2000b]. “Regulated Pushdown Automata,” Acta Cybernetica 18, 653-664.
Meduna, A. and Kolář, D. [2002a]. “Homogenous Grammars with a Reduced Number of Non-Context-Free Productions,” Information Processing Letters 81, 253-257.
Meduna, A. and Kolář, D. [2002b]. “One-Turn Regulated Pushdown Automata and Their Reduction,” Fundamenta Informaticae, Vol. 2002, No. 16, Amsterdam, NL, p. 399-405.
Meduna, A. and Švec, M. [2002]. “Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions,” Acta Cybernetica 15, 353-360.
Meduna, A. and Švec, M. [2003a]. “Descriptional Complexity of Generalized Forbidding Grammars,” International Journal of Computer Mathematics 80, 11-17.
Meduna, A. and Švec, M. [2003b]. “Forbidding E0L Systems,” Theoretical Computer Science 54, 256-276.
Meduna, A. and Vurm, P. [2001]. “Multisequential Grammars with Homogeneous Selectors,” Fundamenta Informaticae 34, 1-7.
Meduna, A., Crooks, C., and Sarek, M. [1994]. “Syntactic Complexity of Regulated Rewriting,” Kybernetika 30, 177-186.
