%% FILE: cv-us.tex
%
% TOPIC: LATEX - CURRICOLUMN VITAE TEMPLATE
%
% Edited by:
% Alexander Meduna & Zbynek Krivka & Jiri Krajicek
%
%%---------------------------------------------------------------------------
%
% Developer Notes:
%
% * To create a new page use
%   \newpage \opening
%
% * Alternate documentclass command:
%   \documentclass[margin,line,11pt,final]{res}
%
% * When publication/presentation list gets longer, divide into subsections
%   by year like this:
%   \section{\bf\small\hspace{8mm}2005}
%
%%----------------------------------------------------------------------------
% ------------ document type selection
\documentclass[overlapped, line, final, 10pt,letterpaper]{res}

\usepackage{hyperref}
%\usepackage{psfig, epsfig}
\usepackage{graphicx}

%---------------------Hyper text INFO
\hypersetup{
  colorlinks,urlcolor=black,
  pdftitle={Alexander Meduna: Curriculum Vitae},
  pdfauthor={Alexander Meduna},
  pdfcreator={\LaTeX\ with package \flqq hyperref\frqq},
  pdfsubject={Curriculum Vitae},
  pdfkeywords={mathematically oriented computer science,
  automata, formal languages, compilers, computer algebra, graphs, metamathematics}
}
% here define your features
\def\Cplusplus{{\rm C\raise.5ex\hbox{\small ++}}}

%%============================================================================%%
%----------------------------- DOCUMENT START ---------------------------------%
%%============================================================================%%
\begin{document}

\fontsize{12}{9} \selectfont
\name{Professor Alexander Meduna}

%-------- photo
\begin{figure}
\begin{flushright}
  % Requires \usepackage{graphicx}
  \includegraphics{meduna-cv-foto.jpg}
\end{flushright}
\end{figure}

%--------Resume style
\begin{resume}

%--- first personal (contact) info table
\begin{ncolumn}{2}
  %--- first column                     %--- second column
  Department of Computer Science        & Phone: +420 541 141 232\\
  Faculty of Information Technology     & Fax: +420 541 141 270\\
  Brno University of Technology         & {\tt meduna@fit.vutbr.cz}\\
  Bo\v{z}et\v{e}chova 2                 & {\tt \verb+http://www.fit.vutbr.cz/~meduna/+}\\
  612 66 Brno                           &\\
  Czech Republic                        &\\
\end{ncolumn}
\fontsize{10}{12} \selectfont

% text format setting used from resume style
\begin{format}
  \title{l} \employer{l} \\
  \dates{l} \location{l} \\
  %\body \\
\end{format}

%---------------------- PROF. ORIENTATION SECTION ------------------------------
\section{\bf General Orientation}
\vspace{0.2cm}

Theoretical Computer Science

%---------------------- SPEC. INTEREST SECTION ---------------------------------
\section{\bf Areas of Special Interest}
\vspace{0.2cm}

Formal languages, Compilers

%-------------------------- SECTION EDUCATION ----------------------------------
\section{\bf Education}
\vspace{0.2cm}

% -------- study at VUT
\title{\textbf{Ph.D.} in Computer Science}
\employer{Brno University of Technology}
\dates{1988}
\location{Brno, Czech Republic}
\begin{position}
  % Add (edit) your comments here, for example:
\end{position}

% -------- study at Palacky University
\title{\textbf{M.S.} in Computer Science}
\employer{Palacky University}
\dates{1982}
\location{Olomouc, Czech Republic}
\begin{position}
  % Add (edit) your comments here, for example:
\end{position}

\title{\textbf{B.S.} in Computer Science}
\employer{Palacky University}
\dates{1981}
\location{Olomouc, Czech Republic}
\begin{position}
  % Add (edit) your comments here, for example:
\end{position}

%----------------------------- SECTION RESEARCH --------------------------------
\newpage
\section{\bf Professional carrier}
\vspace{0.2cm}

% -------- Professor carrier
\employer{Brno University of Technology}
\title{\textbf{Full Professor}}
\dates{2005 - present}
\location{Department of Computer Science\\Brno, Czech Republic}
\begin{position}
  % Add (edit) your comments here, for example:
\end{position}

% -------- Associate Professor carrier
\employer{Brno University of Technology}
\title{\textbf{Associate Professor}}
\dates{1998 - 2005}
\location{Department of Computer Science\\Brno, Czech Republic}
\begin{position}
  % Add (edit) your comments here
\end{position}

% -------- Senior Researcher carrier
\employer{Brno University of Technology}
\title{\textbf{Senior Researcher}}
\dates{1996 - 1998}
\location{Computing Center\\Brno, Czech Republic}
\begin{position}
  % Add (edit) your comments here
\end{position}

% -------- Visiting Assistant Professor carrier
\employer{University of Missouri--Columbia}
\title{\textbf{Visiting Assistant Professor}}
\dates{1988 - 1996}
\location{Department of Computer Science\\Columbia, MO, USA}
\begin{position}
  % Add (edit) your comments here
\end{position}

% -------- Senior Researcher carrier
\employer{Brno University of Technology}
\title{\textbf{Senior Researcher}}
\dates{ 1985 - 1988}
\location{Computing Center\\Brno, Czech Republic}
\begin{position}
  % Add (edit) your comments here
\end{position}

% -------- Junior Researcher carrier
\employer{Palacky University}
\title{\textbf{Researcher}}
\dates{1982 - 1985}
\location{Laboratory of Computer Science\\Olomouc, Czech Republic}
\begin{position}
  % Add (edit) your comments here
\end{position}

%----------------------------- TEACHING SECTION --------------------------------

% text format setting used from resume style
\begin{format}
  \dates{l}  \\
  %\location{l} \\
  \title{l} \employer{l} \\
  \body \\
\end{format}

%\newpage
\section{\bf Classes Taught}
\vspace{0.2cm}

% -------- Actual Teaching at FIT BUT
\dates{2003 -- present}
%\location{}
\title{$\diamond$ Compiler Construction\\
       $\diamond$ Formal Languages\\
       $\diamond$ Modern Theoretical Science}
\employer{Brno University of Technology\\
          Department of Computer Science\\
          Brno, Czech Republic}
\begin{position}% Add (edit) your comments here
\end{position}

% -------- Recent Teaching at BUT
\dates{1999 -- 2005}
%\location{}
\title{$\diamond$ Principles of Compiler Design}
\employer{Brno University of Technology\\
          Computing Center\\
          Brno, Czech Republic}
\begin{position}% Add (edit) your comments here
\end{position}

% -------- Past Teaching at BUT
\dates{1999 -- 2001}
%\location{}
\title{$\diamond$ Theoretical computer science}
\employer{Brno University of Technology\\
          Computing Center\\
          Brno, Czech Republic}
\begin{position}% Add (edit) your comments here
\end{position}

% -------- Past Teaching in USA
\dates{1988 -- 1996}
%\location{}
\title{$\diamond$ CS341 Automata Theory I\\
       $\diamond$ CS441 Automata Theory II\\
       $\diamond$ CS343 Compilers I\\
       $\diamond$ CS443 Compilers II\\
       $\diamond$ CS345 Principles of Programming Languages\\
       $\diamond$ CS352 Operating System Theory}
\employer{University of Missouri--Columbia\\
          Department of Computer Science\\
          Columbia, MO, USA}
\begin{position}% Add (edit) your comments here
\end{position}

% -------- Past Teaching at BUT (long time ago)
\dates{1985 -- 1988}
%\location{}
\title{$\diamond$ Automata and compilers}
\employer{Brno University of Technology\\
          Computing Center\\
          Brno, Czech Republic}
\begin{position}% Add (edit) your comments here
\end{position}

% -------- Past Teaching in Olomouc (long time ago)
\dates{1982 -- 1985}
%\location{}
\title{$\diamond$ Compilers}
\employer{Palacky University\\
          Laboratory of Computer Science\\
          Olomouc, Czech Republic}
\begin{position}% Add (edit) your comments here
\end{position}

%%========================== PUBLIHING SECTION ===============================%%
%\newpage
\section{\bf Publications}
\vspace{0.1cm}

%--------------very long list of publications (each item separeted by keyword "item" and blank line)
\begin{itemize}

  %------------ Books subsection
  \subsection{\normalsize Books}
  \fontsize{8}{8} \selectfont

  \item
	Meduna, A., Zemek, P.: \emph{Regulated Grammars and Automata}. Springer, 2014

  \item
	Meduna, A.: \emph{Formal Languages and Computation: Models and Their Application}. Taylor \& Francis, 2014

	\item
  Meduna, A., Techet, J.: \emph{Scattered Context Grammars and Their Applications}. WIT Press, UK, 2010

	\item
  Meduna, A., Zemek, P.: \emph{Regulated Grammars and Their Transformations}. The FIT BUT press, CZ, 2010
  
  \item
  Meduna, A.: \emph{Elements of Compiler Design}. Taylor \& Francis, 2008 (translated into Chinese in 2009)
    
  \item
  Meduna, A., Kope\v{c}ek, T.: \emph{Conditional Grammars and Their Reduction}. The FIT BUT press, CZ, 2009

  \item
  Meduna, A., \v{S}vec, M.: {\em Grammars with Context Conditions and Their Applications}. Wiley, 2005

  \item
  Meduna, A.: {\em Automata and Languages: Theory and Applications}. Springer, 2000
  

  %------------ Books chapters section
  \subsection{\normalsize Book Chapters}
  
	\item
	 Meduna, A., Zemek, P.: One-Sided Random Context Grammars: A Survey, in \emph{Computing with New Resources}, Springer Verlag, p. 338-351, 2014

  \item
  Meduna, A., Zemek, P.: One-Sided Random Context Grammars with Leftmost Derivations, in \emph{Languages Alive - Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday}, Springer, p. 160-173, 2012

  \item
	Meduna, A., Leupold, P.: Finitely Expandable Deep PDAs, in \emph{Automata, Formal Languages and Algebraic Systems}, World Scientific Publishing, p. 113-123, 2010

  \item
  Meduna, A., Kol\'{a}\v{r}, D.: Descriptional Complexity of Parallel Grammars with Respect to the Number of Nonterminals, in {\em Words, Sequences, Languages: Where Computer Science, Biology, and Linguistics Meet} (Carlos Martin-Vide, ed.), Kluwer, p.~212-225, 2001

  \item
  Meduna, A., Kol\'{a}\v{r}, D.: Descriptional complexity of multi-parallel grammars with respect to the number of nonterminals, in {\em Grammars and Automata for String Processing: from Mathematics and Computer Science to Biology and Back}, p.~212-225, 2000

  \item
  Meduna, A.: On the Number of Nonterminals in Matrix Grammars with Leftmost Derivations, in {\em  New Trends in Formal Languages: Control, Cooperation, and Combinatorics}, Springer, p.~27-39, 1997

  \item
  Meduna, A.: Symbiotic E0L Systems, in {\em Artifical Life} (Gh. Paun, ed.), Black Sea University Press, p.~122-129, 1995

  \item
  Meduna, A.: Matrix Grammars under Leftmost and Rightmost Restrictions, in {\em Mathematical Linguistics and Related Topics} (Gh. Paun, ed.), The Publ. House of the Romanian Academy, p.~243-257, 1994

  %------------ Pepers subsection
  \subsection{\normalsize Refereed Journal Articles (since 1987)}

  \sloppy % force LaTEX to be kind when word need to be separeted
  
	%----------------------- 2017 papers

  %----------------------- 2016 papers
  \item
	Meduna, A., K\v{r}ivka, Z., Zemek, P.: Phrase-Structure Grammars: Normal Forms and Reduction. \emph{The Computer Journal}, p.~1-6, 2016
  \item
	Meduna, A., Soukup, O.: Simple Matrix Grammars and Their Leftmost Variants. \emph{International Journal of Foundations of Computer Science}, p.~359-373, 2016
  \item
	Meduna, A., Soukup, O., Zemek, P.: Ordered Pure Multi-Pushdown Automata. \emph{Theoretical and Applied Informatics}, p.~25-47, 2016
	
  %----------------------- 2015 papers
	\item
  Meduna, A., K\v{r}ivka, Z.: Jumping Grammars. \emph{International Journal of Foundations of Computer Science}, p.~709-731, 2015
	
  %----------------------- 2014 papers
  \item
	Meduna, A., Hor\'{a}\v{c}ek, P.: New Grammar Systems and Their Application Perspectives. \emph{Schedae Informaticae}, p.~47-68, 2014
	\item
  Meduna, A., Koutn\'{y}, J.: On Normal Forms and Erasing Rules in Path-Controlled Grammars. \emph{Schedae Informaticae}, p.~9-18, 2014
  \item
	Meduna, A., K\v{r}ivka, Z., Tesa\v{r}, R.: Alan Mathison Turing - \v{z}ivot a d\'{i}lo [in Czech]. \emph{Pokroky matematiky, fyziky a astronomie}, p.~1-19, 2014
  \item
	Meduna, A., Vr\'{a}bel, L., Zemek, P.: Solutions To Four Open Problems Concerning Controlled Pure Grammar Systems. \emph{International Journal of Computer Mathematics}, p.~1156-1169, 2014
  \item
	Meduna, A., Zemek, P.: Controlled Finite Automata. \emph{Acta Informatica}, p.~327-337, 2014
	\item
	Meduna, A., Zemek, P.: One-Sided Random Context Grammars with a Limited Number of Right Random Context Rules. \emph{Theoretical Computer Science}, p.~127-132, 2014
	
  %----------------------- 2013 papers  
  \item
	Meduna, A., Zemek, P.: Generalized One-Sided Forbidding Grammars. \emph{International Journal of Computer Mathematics}, p.~172-182, 2013
	\item
  Meduna, A., Zemek, P.: Left Random Context ET0L Grammars. \emph{Fundamenta Informaticae}, p.~289-304, 2013
  \item
	Meduna, A., Zemek, P.: On the Generation of Sentences with Their Parses by Propagating Regular-Controlled Grammars. \emph{Theoretical Computer Science}, p.~67-75, 2013

  %----------------------- 2012 papers  
  \item
	Meduna, A., \v{C}erm\'{a}k, M., Hor\'{a}\v{c}ek, P.: Rule-restricted automaton-grammar transducers: Power and linguistic applications. \emph{Mathematics for Applications}, p.~13-35, 2012  
  \item
	Meduna, A., \v{C}erm\'{a}k, M., Koutn\'{y}, J.: Parsing Based on n-Path Tree-Controlled Grammars. \emph{Theoretical and Applied Informatics}, p.~213-228, 2012
  \item
	Meduna, A., Hor\'{a}\v{c}ek, P.: Synchronous Versions of Regulated Grammars: Generative Power and Linguistic Applications. \emph{Theoretical and Applied Informatics}, p.~175-190, 2012
  \item
  Meduna, A., Koutn\'{y}, J.: Tree-controlled Grammars with Restrictions Placed upon Cuts and Paths. \emph{Kybernetika}, p.~165-175, 2012
	\item
	Meduna, A., Vr\'{a}bel, L., Zemek, P.: An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. {\em Lecture Notes in Computer Science} 7386, p.~236-243, 2012
	\item
  Meduna, A., Zemek, P.: Controlled Pure Grammar Systems. \emph{Journal of Universal Computer Science}, p.~2024-2040, 2012
	\item
	Meduna, A., Zemek, P.: Jumping Finite Automata. \emph{International Journal of Foundations of Computer Science}, p.~1555-1578, 2012
	\item
	Meduna, A., Zemek, P.: Nonterminal Complexity of One-Sided Random Context Grammars. {\em Acta Informatica}, p.~55-68, 2012
	\item
	Meduna, A., Zemek, P.: On One-Sided Forbidding Grammars and Selective Substitution Grammars. {\em International Journal of Computer Mathematics}, p.~586-596, 2012
	\item
	Meduna, A., Zemek, P.: One-Sided Random Context Grammars with Leftmost Derivations. {\em Lecture Notes in Computer Science} 7300, p.~160-173, 2012
    
  %----------------------- 2011 papers  
	\item
	Meduna, A., K\v{r}oustek, J., \v{Z}idek, S., Kol\'{a}\v{r}, D.: Scattered Context Grammars with Priority. {\em International Journal of Advanced Research in Computer Science}, p.~1-6, 2011
	\item
	Meduna, A., Zemek, P.: One-Sided Random Context Grammars. {\em Acta Informatica}, p.~149-163, 2011
	\item
	Meduna, A., Zemek, P.: Workspace Theorems for Regular-Controlled Grammars. {\em Theoretical Computer Science}, p.~4604-4612, 2011

  %----------------------- 2010 papers
	\item
	Meduna, A., \v{C}erm\'{a}k, M., Masopust, T.: Some Power-Decreasing Derivation Restrictions in Grammar Systems. {\em Schedae Informaticae}, p.~23-34, 2010
	\item
	Meduna, A., Goldefus, F., Masopust, T.: Left-Forbidding Cooperating Distributed Grammar Systems. {\em Theoretical Computer Science}, p.~3661-3667, 2010

	\item
	Meduna, A., Luk\'{a}\v{s}, R.: Multigenerative Grammar Systems and Matrix Grammars. {\em Kybernetika}, p.~68-82, 2010

  %----------------------- 2009 papers
	\item
  Meduna, A., Techet, J.: An Infinite Hierarchy of Language Families Generated by Scattered Context Grammars with n-Limited Derivations. {\em Theoretical Computer Science}, p.~1961-1969, 2009
  \item
  Meduna, A., Masopust, T.: On context-free rewriting with a simple restriction and its computational completeness. {\em RAIRO – Theoretical Informatics and Applications}, p.~365-378, 2009
  \item
  Meduna, A., Masopust, T.: On Pure Multi-Pushdown Automata that Perform Complete Pushdown Pops. {\em Acta Cybernetica}, p.~537-552, 2009

  %----------------------- 2008 papers
  \item
  Meduna, A., Rychnovsk\'{y}, L.: Infinite Language Hierarchy Based on Regular-Regulated Right-Linear Grammars with Start Strings. {\em Philippine Computing Journal}, p.~1-5, 2008
  
  \item
  Meduna, A., Techet, J.: Scattered Context Grammars that Erase Nonterminals in a Generalized k-Limited Way. {\em Acta Informatica}, p.~593-608, 2008

  \item
  Meduna, A., Masopust, T., \v{S}im\'{a}\v{c}ek, J.: Two Power-Decreasing Derivation Restrictions in Generalized Scattered Context Grammars. {\em Acta Cybernetica}, p.~783-793, 2008 
  
  \item
  Meduna, A., Masopust, T.: On Descriptional Complexity of Partially Parallel Grammars. {\em Fundamenta Informaticae}, p.~407-415, 2008 

  %----------------------- 2007 papers
  \item
  Meduna, A., Bidlo, R., Blatn\'{y}, P.: Automata with Two-Sided Pushdowns Defined over Free Groups Generated by Reduced Alphabets. {\em Kybernetika}, p.~21-35, 2007 
  
  \item
  Meduna, A., Bidlo, R., Blatn\'{y}, P.: Context-Free and E0L Derivations over Free Groups. {\em Schedae Informaticae}, p.~14-24, 2007
  
  \item
  Meduna, A., Kopecek, T., \v{S}vec, M.: A formalization of derivation similarity in the formal language theory and its illustration in terms of Lindenmayer systems. {\em International Journal of Computer Mathematics}, p.~1555-1566, 2007
  
  \item
  Meduna, A., Masopust, T.: Descriptional Complexity of Semi-Conditional Grammars. {\em Information Processing Letters}, p.~29-31, 2007 
  
  \item
  Meduna, A., Masopust, T.: Self-Regulating Finite Automata. {\em Acta Cybernetica}, p.~135-153, 2007
  
  \item
  Meduna, A., Techet, J.: Canonical Scattered Context Generators of Sentences with Their Parses. {\em Theoretical Computer Science}, p.~73-81, 2007
  
  %----------------------- 2006 papers  
  \item
	Meduna, A., K\v{r}ivka, Z., Sch\"{o}necker, R.: Generation of Languages by Rewriting Systems that Resemble Automata.
	{\em International Journal of Foundations of Computer Science}, p.~1223-1229, 2006 

  \item
	Meduna, A., Luk\'{a}\v{s}, R.: Multigenerative Grammar Systems. {\em Schedae Informatice}, p.~11, 2006 
   
  \item
  Meduna, A.: Deep Pushdown Automata. {\em Acta Informatica}, p.~114-124, 2006   
  
  %----------------------- 2005 papers
  \item
  Meduna, A., Lorenc, L.: Self-Reproducing Pushdown Transducers. {\em Kybernetika}, p.~533-539, 2005

  \item
  Meduna, A., Techet, J.: Generation of Sentences with Their Parses: the Case of Propagating Scattered Context Grammars. {\em Acta Cybernetica}, p.~11-20, 2005

  %----------------------- 2004 papers
  \item
  Meduna, A., Kope\v{c}ek, T.: Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism. {\em Computing and Informatics}, p.~287-302, 2004

  \item
  Meduna, A., V\'{i}tek, M.: New language operations in formal language theory. {\em Schedae Informaticae}, p.~123-150, 2004

  %----------------------- 2003 papers
  \item
  Meduna, A.: A Simultaneous Reduction of Several Measures of Descriptional Complexity in Scattered Context Grammars. {\em Information Processing Letters}, p.~214-219, 2003

  \item
  Meduna, A.: On the Degree of Scattered Context-Sensitivity, {\em Theoretical Computer Science}, p.~2121-2124, 2003

  \item
  Meduna, A., \v{S}vec, M.: Descriptional Complexity of Generalized Forbidding Grammars. {\em International Journal of Computer Mathematics}, p.~11-17, 2003

  \item
  Meduna, A., \v{S}vec, M.: Forbidding E0L Systems. {\em Theoretical Computer Science}, p.~256-276, 2003

  \item
  Meduna, A.: Coincidental Extention of Scattered Context Languages. {\em Acta Informatica}, p.~307-314, 2003

  \item
  Meduna, A.: Simultaneously One-Turn Two-Pushdown Automata. {\em International Journal of Computer Mathematics}, p.~1-9, 2003

  \item
  Meduna, A.: Two-Way Metalinear PC Grammar Systems and Their Descriptional Complexity. {\em Acta Cybernetica}, p.~126-137, 2003

  %----------------------- 2002 papers
  \item
  Meduna, A., Kol\'{a}\v{r}, D.: Homogenous Grammars with a Reduced Number of Non-Context-Free Productions. {\em Information Processing Letters}, p.~253-257, 2002

  \item
  Meduna, A., Kol\'{a}\v{r}, D.: One-Turn Regulated Pushdown Automata and Their Reduction. {\em Fundamenta Informaticae}, p.~399-405, 2002

  \item
  Meduna, A., \v{S}vec, M.: Reduction of Simple Semi-Conditional Grammars with Respect to the Number of Conditional Productions. {\em Acta Cybernetica}, p.~353-360, 2002

  \item
  Meduna, A.: Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. {\em Journal of Automata, Languages and Combinatorics}, p.~571-577, 2002

  \item
  Meduna, A.: Simultaneously One-Turn Two-Pushdown Automata. {\em International Journal of Computer Mathematics}, p.~111-121, 2002

  %----------------------- 2001 papers
  \item
  Meduna, A., Vurm Petr: Multisequential Grammars with Homogeneous Selectors. {\em International Journal of Computer Mathematics}, p.~6, 2001

  \item
  Meduna, A.: Descriptional Complexity of Partially Parallel Grammars. {\em DCAGRS}, p.~15-21, 2001

  \item
  Meduna, A.: Uniform Generation of Languages by Scattered Context Grammars, {\em Fundamenta Informaticae}, p.~231-235, 2001

  %----------------------- 2000 papers

  \item
  Meduna, A., Kol\'{a}\v{r}, D.: Regulated Pushdown Automata. {\em Acta Cybernetica}, p.~653-664, 2000

  \item
  Meduna, A.: Context-Free Multirewriting with a Reduced Number of Nonterminals, p.~164, 2000

  \item
  Meduna, A.: Generative Power of Three-Nonterminal Scattered Context Grammars. {\em Theoretical Computer Science}, p.~625-631, 2000

  \item
  Meduna, A.: Terminating Left-Hand Sides of Scattered Context Grammars. {\em Theoretical Computer Science}, p.~423-427, 2000

  %----------------------- 1999 papers
  \item
  Meduna, A.: Prefix Pushdown Automata. {\em International Journal of Computer Mathematics}, p.~164-182, 1999

  %----------------------- 1998 papers
  \item
  Meduna, A.: Descriptional Complexity of Multi-Continues Grammars. {\em Acta Cybernetica}, p.~375-384, 1998

  \item
  Meduna, A.: Economical Transformations of Scattered Context Grammars to Phrase-Structure Grammars. {\em Acta Cybernetica}, p.~225-242, 1998

  \item
  Meduna, A.: Middle Quotients of Linear Languages. {\em International Journal of Computer Mathematics}, p.~281-289, 1998

  \item
  Meduna, A.: Uniform Rewriting Based on Permutations. {\em International Journal of Computer Mathematics}, p.~57-74, 1998

  %----------------------- 1997 papers

  \item
  Meduna, A.: Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages. {\em International Journal of Computer Mathematics}, p.~179-189, 1997

  %----------------------- 1996 papers
  \item
  Meduna, A.: Four-Nonterminal Scattered Context Grammars Characterize the Family of Recursively Enumerable Languages. {\em International Journal of Computer Mathematics}, p.~465-474, 1996

  \item
  Meduna, A.: Syntactic Complexity of Context-Free Grammars over Word Monoids. {\em Acta Informatica}, p.~457-474, 1996

  %----------------------- 1995 papers
  \item
  Meduna, A.: A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars. {\em EATCS Bulletin}, p.~104-106, 1995

  \item
  Meduna, A.: Symbiotic E0L Systems. {\em Artifical Life:Grammatical Models}, p.~122-129, 1995

  \item
  Meduna, A.: Syntactic Complexity of Scattered Context Grammars. {\em Acta Informatica}, p.~126-139, 1995

  %----------------------- 1994 papers
  \item
  Meduna, A., Gopalaratnam, A.: On Semi-Conditional Grammars with Productions Having either Forbidding or Permitting Conditions. {\em Kybernetika}, p.~309-323, 1994

  \item
  Meduna, A.: Matrix Grammars under Leftmost and Rightmost Restrictions. {\em Mathematical Linguistics and Related Topics}, p.~243-257, 1994

  %----------------------- 1993 papers
  \item
  Meduna, A., Crooks, C., Sarek, M.: Syntactic Complexity of Regulated Rewriting. {\em Kybernetika}, p.~177-186, 1993

  \item
  Meduna, A., Csuhaj-Varju, E.: Grammars with Context Conditions. {\em Kybernetika}, p.~199-213, 1993

  \item
  Meduna, A.: Canonical Scattered Rewriting. {\em International Journal of Computer Mathematics}, p.~122-129, 1993

  %----------------------- 1992 papers
  \item
  Meduna, A.: A Formalization of Sequential, Parallel, and Continuous Rewriting. {\em International Journal of Computer Mathematics}, p.~24-32, 1992

  \item
  Meduna, A.: Symbiotic E0L Systems. {\em Acta Cybernetica}, p.~164-172, 1992

  %----------------------- 1991 papers
  \item
  Meduna, A.: Controlled Systolic Automata. {\em Parallel Computation in the Midwestern Academic Environment}, p.~56-66, 1991

  %----------------------- 1990 papers
  \item
  Meduna, A.: Generalized Forbidding Grammars. {\em International Journal of Computer Mathematics}, p.~31-38, 1990

  \item
  Meduna, A.: Global Context Conditional Grammars. {\em Journal of Automata, Languages and Combinatorics}, p.~31-38, 1990

  \item
  Meduna, A.: Parallel Compilers Based on L Systems. {\em Parallel Computation in the Midwestern Academic Environment}, p.~215-224, 1990

  \item
  Meduna, A.: Regulated Rewriting. {\em Missourian Annual Conference on Computing}, p.~25-31, 1990

  %----------------------- 1988 papers
  \item
  Meduna, A., Horvath, G.: On State Grammars. {\em Acta Cybernetica}, p.~4-14, 1988

  \item
  Meduna, A.: Context-Free Derivations on Word Monoids. {\em Acta Informatica}, p.~781-786, 1988

  %----------------------- 1987 papers
  \item
  Meduna, A.: Evaluated Grammars. {\em Acta Cybernetica}, p.~169-176, 1987

\end{itemize}

%%---------------------------------------------------------------------------%%
\end{resume}

\end{document}
%%============================ END OF DOCUMENT ===============================%%