\documentclass{rtaloop}
\rtalabel{ground-regular}

\begin{document}
\begin{solvedproblem}{Hubert Comon, Max Dauchet}{}{April 1991}

\begin{abstract}
Is it possible to decide whether the set of ground normal forms
with respect to a given (finite) term-rewriting system
is a regular tree language?  
\end{abstract}

Is it possible to decide whether the set of ground normal forms
with respect to a given (finite) term-rewriting system
is a regular tree language?  
See \cite{G91:stacs}\cite{K91:rta}.


\begin{remark}
This has been answered in the affirmative
\cite{VG92:eatcs,KT92:ctrs,KucherovTajine95ic,HH92:ctrs}.
\end{remark}

\end{solvedproblem}
\end{document}
