Bibliograph. Daten | Kufleitner, Manfred: Polynomials, Fragments of Temporal Logic and the Variety DA over Traces. Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Technischer Bericht Informatik Nr. 2006/03. 17 Seiten, englisch.
|
CR-Klassif. | F.4.1 (Mathematical Logic) F.4.3 (Formal Languages)
|
Keywords | Mazurkiewicz traces; trace languages; polynomial closure; temporal logic |
Kurzfassung | We show that some language theoretic and logical characterizations of recognizable word languages whose syntactic monoid is in the variety DA also hold over traces. To this aim we give algebraic characterizations for the language operations of generating the polynomial closure and generating the unambiguous polynomial closure over traces.
We also show that there exist natural fragments of local temporal logic that describe this class of languages corresponding to DA. All characterizations are known to hold for words.
|
Volltext und andere Links | PDF (176591 Bytes) PostScript (362575 Bytes)
|
Kontakt | kufleitner@fmi.uni-stuttgart.de |
Abteilung(en) | Universität Stuttgart, Institut für Formale Methoden der Informatik, Theoretische Informatik
|
Eingabedatum | 7. Februar 2006 |
---|