Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids

D Kirsten

Open Access

https://doi.org/10.1007/s002240011006

Copy DOI

Journal: Theory of Computing Systems	Publication Date: Jan 1, 2001
Citations: 2	License type: other-oa

Abstract

Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids

Full Text

Published version (

Free)

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Paper Title

Journal

Date

Author