• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    Closure properties and complexity of rational sets of regular languages 
    •   QMRO Home
    • School of Electronic Engineering and Computer Science
    • Electronic Engineering and Computer Science
    • Closure properties and complexity of rational sets of regular languages
    •   QMRO Home
    • School of Electronic Engineering and Computer Science
    • Electronic Engineering and Computer Science
    • Closure properties and complexity of rational sets of regular languages
    ‌
    ‌

    Browse

    All of QMROCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    ‌
    ‌

    Administrators only

    Login
    ‌
    ‌

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Closure properties and complexity of rational sets of regular languages

    View/Open
    Accepted version (2.694Mb)
    Volume
    605
    Pagination
    62 - 79
    DOI
    10.1016/j.tcs.2015.08.035
    Journal
    THEORETICAL COMPUTER SCIENCE
    ISSN
    0304-3975
    Metadata
    Show full item record
    Authors
    Holzer, A; Schallhart, C; Tautschnig, M; Veith, H
    URI
    http://qmro.qmul.ac.uk/xmlui/handle/123456789/11032
    Collections
    • Electronic Engineering and Computer Science [2674]
    Copyright statements
    2016 Elsevier B.V. or its licensors or contributors
    Twitter iconFollow QMUL on Twitter
    Twitter iconFollow QM Research
    Online on twitter
    Facebook iconLike us on Facebook
    • Site Map
    • Privacy and cookies
    • Disclaimer
    • Accessibility
    • Contacts
    • Intranet
    • Current students

    Modern Slavery Statement

    Queen Mary University of London
    Mile End Road
    London E1 4NS
    Tel: +44 (0)20 7882 5555

    © Queen Mary University of London.