Basket

    1.
    0336039 - MÚ 2010 RIV US eng J - Journal Article
    Koucký, Michal
    Circuit complexity of regular languages.
    Theory of Computing Systems. Roč. 45, č. 4 (2009), s. 865-879. ISSN 1432-4350. E-ISSN 1433-0490
    R&D Projects: GA ČR GP201/07/P276; GA MŠMT(CZ) 1M0545
    Institutional research plan: CEZ:AV0Z10190503
    Keywords : regular languages * circuit complexity * upper and lower bounds
    Subject RIV: BA - General Mathematics
    Impact factor: 0.726, year: 2009
    Permanent Link: http://hdl.handle.net/11104/0180367
    FileDownloadSizeCommentaryVersionAccess
    Koucky2.pdf1323.5 KBPublisher’s postprintrequire
     
     

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

Accept allSettingsReject all