Abstract
In this paper we present an application of nondeterministic multihead automata to the membership problem for trace languages. Here our result shows that regular and context-free trace languages are not very complicated. On the other hand, we make two simple observations which are the evidence that regular trace languages are very complicated from the algebraic point of view.
Get full access to this article
View all access options for this article.