Abstract
The time complexity of a class of algorithms for problems on trace languages is studied both in the worst and in the average case. Membership problem for regular trace languages and the problem of counting the cardinality of a trace can be solved by algorithms belonging to such a class. These algorithms are described by a recursive procedure scheme whose input is a trace represented by a corresponding string. Under reasonable assumptions the worst case time complexity on traces of length n is ϑ(nα), where α is the cardinality of the largest clique in the concurrent alphabet .
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.
