dc.contributor.author | Holzer, A | en_US |
dc.contributor.author | Schallhart, C | en_US |
dc.contributor.author | Tautschnig, M | en_US |
dc.contributor.author | Veith, H | en_US |
dc.date.accessioned | 2016-02-03T16:46:16Z | |
dc.date.issued | 2015-11-09 | en_US |
dc.date.submitted | 2015-12-08T15:25:58.800Z | |
dc.identifier.issn | 0304-3975 | en_US |
dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/11032 | |
dc.description.sponsorship | This 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.extent | 62 - 79 | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | THEORETICAL COMPUTER SCIENCE | en_US |
dc.subject | Rational sets | en_US |
dc.subject | Regular languages | en_US |
dc.subject | Test specification in FQL | en_US |
dc.subject | Closure properties | en_US |
dc.subject | Decision problems | en_US |
dc.title | Closure properties and complexity of rational sets of regular languages | en_US |
dc.type | Article | |
dc.rights.holder | 2016 Elsevier B.V. or its licensors or contributors | |
dc.identifier.doi | 10.1016/j.tcs.2015.08.035 | en_US |
pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000365059800005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
pubs.notes | No embargo | en_US |
pubs.publication-status | Published | en_US |
pubs.volume | 605 | en_US |