Recognizable closures and submonoids of free partially commutative monoids

Abstract

AbstractThe main result of this paper is the presentation of two sufficient conditions for the closure [X] of X and the closure [X∗] of X∗, respectively, in any free partially commutative monoid for any regular language X, to be recognizable. Several previously obtained sufficient conditions for [X] to be recognizable can be seen to imply one of those two conditions

Similar works

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.