Technical Report TR-2009-04

BibliographyDiekert, Volker; Kufleitner, Manfred: Fragments of first-order logic over infinite words.
University of Stuttgart, Faculty of Computer Science, Electrical Engineering, and Information Technology, Technical Report Computer Science No. 2009/04.
24 pages, english.
CR-SchemaF.4.1 (Mathematical Logic)
F.4.3 (Formal Languages)
Keywordsinfinite words; regular languages; first-order logic; automata theory; semigroups; topology
Abstract

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.

Full text and
other links
PDF (283809 Bytes)
Contactkufleitner@fmi.uni-stuttgart.de
Department(s)University of Stuttgart, Institute of Formal Methods in Computer Science, Theoretical Computer Science
Entry dateJune 16, 2009
   Publ. Computer Science