• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesTitleAuthorsKAUST AuthorsIssue DateSubmit DateSubjectsThis CollectionTitleAuthorsKAUST AuthorsIssue DateSubmit DateSubjects

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    WQO is Decidable for Factorial Languages

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    1-s2.0-S0890540117301396-main.pdf
    Size:
    338.1Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Embargo End Date:
    2019-08-08
    Download
    Type
    Article
    Authors
    Atminas, Aistis
    Lozin, Vadim
    Moshkov, Mikhail cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2017-08-08
    Permanent link to this record
    http://hdl.handle.net/10754/625350
    
    Metadata
    Show full item record
    Abstract
    A language is factorial if it is closed under taking factors, i.e. contiguous subwords. Every factorial language can be described by an antidictionary, i.e. a minimal set of forbidden factors. We show that the problem of deciding whether a factorial language given by a finite antidictionary is well-quasi-ordered under the factor containment relation can be solved in polynomial time. We also discuss possible ways to extend our solution to permutations and graphs.
    Citation
    Atminas A, Lozin V, Moshkov M (2017) WQO is Decidable for Factorial Languages. Information and Computation. Available: http://dx.doi.org/10.1016/j.ic.2017.08.001.
    Sponsors
    This author gratefully acknowledges support from EPSRC, grant EP/L020408/1. Support of KAUST is gratefully acknowledged.
    Publisher
    Elsevier BV
    Journal
    Information and Computation
    ISSN
    0890-5401
    DOI
    10.1016/j.ic.2017.08.001
    Additional Links
    http://www.sciencedirect.com/science/article/pii/S0890540117301396
    ae974a485f413a2113503eed53cd6c53
    10.1016/j.ic.2017.08.001
    Scopus Count
    Collections
    Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2019  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.