About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
STOC 1981
Conference paper
Equations between regular terms and an application to process logic
Abstract
Regular terms with the Kleene operations U,;, and ∗ can be thought of as operators on languages, generating other languages. An equation τ1 = τ2 between two such terms is said to be salisfiable just in case languages exist which make this equation true. We show that the satisfiability problem even for ∗-free regular terms is undecidable. Similar techniques are used to show that a very natural extension of the Process Logic of Harel, Kozen and Parikh is undecidable.