Please use this identifier to cite or link to this item: http://dx.doi.org/10.18419/opus-2705
Authors: Kufleitner, Manfred
Lauser, Alexander
Title: Around dot-depth one
Issue Date: 2011
metadata.ubs.publikation.typ: Arbeitspapier
Series/Report no.: Technischer Bericht / Universität Stuttgart, Fakultät Informatik, Elektrotechnik und Informationstechnik;2011,3
URI: http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-64741
http://elib.uni-stuttgart.de/handle/11682/2722
http://dx.doi.org/10.18419/opus-2705
Abstract: The dot-depth hierarchy is a classification of star-free languages. It is related to the quantifier alternation hierarchy of first-order logic over finite words. We consider fragments of languages with dot-depth 1/2 and dot-depth 1 obtained by prohibiting the specification of prefixes or suffixes. As it turns out, these language classes are in one-to-one correspondence with fragments of existential first-order logic without min- or max-predicate. For all fragments, we obtain effective algebraic characterizations. Moreover, we give new combinatorial proofs for the decidability of the membership problem for dot-depth 1/2 and dot-depth 1.
Appears in Collections:05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Files in This Item:
File Description SizeFormat 
TR_2011_03.pdf483,39 kBAdobe PDFView/Open


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