Number of the records: 1  

Complexity in union-free regular languages

  1. 1.
    SYSNO0369498
    TitleComplexity in union-free regular languages
    Author(s) Jirásková, G. (SK)
    Masopust, Tomáš (MU-W) RID, ORCID, SAI
    Source Title International Journal of Foundations of Computer Science. Roč. 22, č. 7 (2011), s. 1639-1653
    Document TypeČlánek v odborném periodiku
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountrySG
    Keywords Union-free regular language * one-cycle-free-path automaton * descriptional complexity
    URLhttp://www.worldscinet.com/ijfcs/22/2207/S0129054111008933.html
    Permanent Linkhttp://hdl.handle.net/11104/0203547
    FileDownloadSizeCommentaryVersionAccess
    Masopust.pdf2404.2 KBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.