The atnext/atprevious hierarchy on the starfree languages

DSpace Repository

Show simple item record Borchert, Bernd de_DE Tesson, Pascal de_DE 2004-12-06 de_DE 2014-03-18T10:13:39Z 2004-12-06 de_DE 2014-03-18T10:13:39Z 2004 de_DE
dc.identifier.other 115141065 de_DE
dc.identifier.uri de_DE
dc.description.abstract The temporal logic operators atnext and atprevious are alternatives for the operators until and since. P atnext Q has the meaning: at the next position in the future where Q holds it holds P. We define an asymmetric but natural notion of depth for the expressions of this linear temporal logic. The sequence of classes at_n of languages expressible via such depth-n expressions gives a parametrization of the starfree regular languages which we call the atnext/atprevious hierarchy, or simply at hierarchy. It turns out that the at hierarchy equals the hierarchy given by the n-fold weakly iterated block product of DA. It is shown that the at hierarchy is situated properly between the until/since and the dot-depth hierarchy. en
dc.language.iso en de_DE
dc.publisher Universität Tübingen de_DE
dc.rights ubt-nopod de_DE
dc.rights.uri de_DE
dc.rights.uri en
dc.subject.classification Temporale Logik , Dot-Depth-Hierarchie de_DE
dc.subject.ddc 004 de_DE
dc.title The atnext/atprevious hierarchy on the starfree languages en
dc.type Report (Bericht) de_DE 2012-10-11 de_DE
utue.publikation.fachbereich Sonstige - Informations- und Kognitionswissenschaften de_DE
utue.publikation.fakultaet 7 Mathematisch-Naturwissenschaftliche Fakultät de_DE
dcterms.DCMIType Text de_DE
utue.publikation.typ report de_DE 1483 de_DE
utue.opus.portal wsi de_DE
utue.opus.portalzaehlung 2004.11000 de_DE
utue.publikation.source WSI ; 2004 ; 11 de_DE
utue.publikation.reihenname WSI-Reports - Schriftenreihe des Wilhelm-Schickard-Instituts für Informatik de_DE
utue.publikation.zsausgabe 2004, 11
utue.publikation.erstkatid 2919855-0


This item appears in the following Collection(s)

Show simple item record