Show simple item record

dc.contributor.authorHolzer, Aen_US
dc.contributor.authorSchallhart, Cen_US
dc.contributor.authorTautschnig, Men_US
dc.contributor.authorVeith, Hen_US
dc.date.accessioned2016-02-03T16:46:16Z
dc.date.issued2015-11-09en_US
dc.date.submitted2015-12-08T15:25:58.800Z
dc.identifier.issn0304-3975en_US
dc.identifier.urihttp://qmro.qmul.ac.uk/xmlui/handle/123456789/11032
dc.description.sponsorshipThis work received funding in part by the National Research Network RiSE on Rigorous Systems Engineering (Austrian Science Fund (FWF): S11403-N23), by the Vienna Science and Technology Fund (WWTF) through grant PROSEED, by an Erwin Schrödinger Fellowship (Austrian Science Fund (FWF): J3696-N26), and by the European Research Council under the European Community's Seventh Framework Programme (FP7/2007–2013)/ERC grant agreement DIADEM no. 246858.en_US
dc.format.extent62 - 79en_US
dc.language.isoenen_US
dc.relation.ispartofTHEORETICAL COMPUTER SCIENCEen_US
dc.subjectRational setsen_US
dc.subjectRegular languagesen_US
dc.subjectTest specification in FQLen_US
dc.subjectClosure propertiesen_US
dc.subjectDecision problemsen_US
dc.titleClosure properties and complexity of rational sets of regular languagesen_US
dc.typeArticle
dc.rights.holder2016 Elsevier B.V. or its licensors or contributors
dc.identifier.doi10.1016/j.tcs.2015.08.035en_US
pubs.author-urlhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000365059800005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6aen_US
pubs.notesNo embargoen_US
pubs.publication-statusPublisheden_US
pubs.volume605en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record