Number of the records: 1  

Complexity in Union-Free Regular Languages

  1. 1.
    SYSNO0346729
    TitleComplexity in Union-Free Regular Languages
    Author(s) Jirásková, G. (SK)
    Masopust, Tomáš (MU-W) RID, ORCID, SAI
    Source Title Developments in Language Theory. S. 255-266. - Berlin : Springer, 2010 / Gao Y. ; Lu H. ; Seki S.
    Conference DLT2010. 14th International Conference on Developments in Language Theory, London, 17.08.2010-20.08.2010
    Document TypeKonferenční příspěvek (zahraniční konf.)
    CEZAV0Z10190503 - MU-W (2005-2011)
    Languageeng
    CountryDE
    Keywords descriptional complexity * union-free regular language * one-cycle-free-path finite automaton
    URLhttp://link.springer.com/chapter/10.1007%2F978-3-642-14455-4_24
    Permanent Linkhttp://hdl.handle.net/11104/0187671
    FileDownloadSizeCommentaryVersionAccess
    Masopust2.pdf1242.6 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.