Equations between Regular Terms and an Application to Process Logic
作者： Rohit Parikh , Ashok Chandra , Joe Halpern , Albert Meyer
DOI: 10.1137/0214066
关键词: Extension (predicate logic) 、 Regular sets 、 Process logic 、 Undecidable problem 、 Discrete mathematics 、 Context-free language 、 Combinatorics 、 Boolean satisfiability problem 、 Abstract family of languages 、 Mathematics
摘要: Regular terms with the Kleene operations $ \cup $, ; and * can be thought of as operators on languages, generating other languages. An equation $\tau _1 = \tau _2 between two such is said to satisfiable just in case languages exist which make this true. We show that satisfiability problem even for $-free regular undecidable. Similar techniques are used a very natural extension Process Logic Harel, Kozen Parikh
sci-hub.se 参考文章(0)