Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2695
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKallas, Jakubde
dc.contributor.authorKufleitner, Manfredde
dc.contributor.authorLauser, Alexanderde
dc.date.accessioned2011-02-28de
dc.date.accessioned2016-03-31T07:59:02Z-
dc.date.available2011-02-28de
dc.date.available2016-03-31T07:59:02Z-
dc.date.issued2010de
dc.identifier.other381920259de
dc.identifier.urihttp://nbn-resolving.de/urn:nbn:de:bsz:93-opus-60273de
dc.identifier.urihttp://elib.uni-stuttgart.de/handle/11682/2712-
dc.identifier.urihttp://dx.doi.org/10.18419/opus-2695-
dc.description.abstractWe consider fragments of first-order logic and as models we allow finite andinfinite words simultaneously. The only binary relations apart from equalityare order comparison < and the successor predicate +1. We givecharacterizations of the fragments Sigma2 = Sigma2[<,+1] and FO2 = FO2[<,+1] interms of algebraic and topological properties. To this end we introduce thefactor topology over infinite words. It turns out that a language L is in theintersection of FO2 and Sigma2 if and only if L is the interior of an FO2language. Symmetrically, a language is in the intersection of FO2 and Pi2 ifand only if it is the topological closure of an FO2 language. The fragmentDelta2, which by definition is the intersection Sigma2 and Pi2 contains exactlythe clopen languages in FO2. In particular, over infinite words Delta2 is astrict subclass of FO2. Our characterizations yield decidability of themembership problem for all these fragments over finite and infinite words; andas a corollary we also obtain decidability for infinite words. Moreover, wegive a new decidable algebraic characterization of dot-depth 3/2 over finitewords. Decidability of dot-depth 3/2 over finite words was first shown by Glaßer andSchmitz in STACS 2000, and decidability of the membership problem for FO2 overinfinite words was shown 1998 by Wilke in his habilitation thesis whereasdecidability of Sigma2 over infinite words was not known before.en
dc.language.isoende
dc.relation.ispartofseriesTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2010,8de
dc.rightsinfo:eu-repo/semantics/openAccessde
dc.subject.ddc004de
dc.subject.otherinfinite words , regular languages , first-order logic , automata theory , semigroups , topologyen
dc.titleFirst-order fragments with successor over infinite wordsen
dc.typeworkingPaperde
dc.date.updated2013-06-26de
ubs.fakultaetFakultät Informatik, Elektrotechnik und Informationstechnikde
ubs.institutInstitut für Formale Methoden der Informatikde
ubs.opusid6027de
ubs.publikation.typArbeitspapierde
ubs.schriftenreihe.nameTechnischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnikde
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
TR_2010_08.pdf425,13 kBAdobe PDFView/Open


Items in OPUS are protected by copyright, with all rights reserved, unless otherwise indicated.