Abstract
We define a completely ordered (c.o.) monoid to be a set equipped with monoid and complete lattice structures such that the product is continuous in each argument. The languages over an alphabet form a c.o. monoid. We give a generalization of Kleene's theorem from languages to elements of an arbitrary c.o. monoid. In the case of the c.o. monoid of all binary relations on a set we obtain the computational equivalence between flowchart-like nondeterministic programs and structured nondeterministic programs constructed using the generalization of the rational operations on languages.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
