Abstract
Length preserving morphisms and inverse of substitutions are two well-studied operations on regular languages. Their connection with varieties generated by power monoids was established independently by Reutenauer and Straubing in 1979. More recently, an ordered version of this theory was proposed by Polák and by the authors. In this paper, we present an improved version of these results and obtain the following consequences. Given a variety of finite ordered monoids V , let P ↑ V be the variety of finite ordered monoids generated by the upper set monoids of members of V . Then P ↑ ( P ↑ V ) = P ↑ V . This contrasts with the known results for the unordered case: the operator PV corresponding to power monoids satisfies P 3 V = P 4 V , but the varieties V , PV , P 2 V and P 3 V can be distinct.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
