Technischer Bericht TR-2009-04

Bibliograph.
Daten
Diekert, Volker; Kufleitner, Manfred: Fragments of first-order logic over infinite words.
Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik, Technischer Bericht Informatik Nr. 2009/04.
24 Seiten, englisch.
CR-Klassif.F.4.1 (Mathematical Logic)
F.4.3 (Formal Languages)
Keywordsinfinite words; regular languages; first-order logic; automata theory; semigroups; topology
Kurzfassung

We give topological and algebraic characterizations as well as language theoretic descriptions of the following subclasses of first-order logic for omega-languages: Sigma2, FO2, the intersection of FO2 and Sigma2, and Delta2 (and by duality Pi2 and the intersection of FO2 and Pi2). These descriptions extend the respective results for finite words. In particular, we relate the above fragments to language classes of certain (unambiguous) polynomials. An immediate consequence is the decidability of the membership problem of these classes, but this was shown before by Wilke and Bojanczyk and is therefore not our main focus. The paper is about the interplay of algebraic, topological, and language theoretic properties.

Volltext und
andere Links
PDF (283809 Bytes)
Kontaktkufleitner@fmi.uni-stuttgart.de
Abteilung(en)Universität Stuttgart, Institut für Formale Methoden der Informatik, Theoretische Informatik
Eingabedatum16. Juni 2009
   Publ. Informatik