Abstract
A.C. Shaw has introduced the concept of the flow expression which is an extended regular expression and state several results with some conjectures. His conjecture that the flow expressions define context-sensitive languages has been answered negatively by two of the present authors, that is, the flow languages are recursively enumerable. In this paper, it is shown that flow languages for some restricted class of flow expressions are equivalent to Petri net languages. Some related decision problems for flow expressions are also discussed.
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.
