Number of the records: 1  

Operational Complexity: NFA-to-DFA Trade-Off

  1. TitleOperational Complexity: NFA-to-DFA Trade-Off
    Author Hospodár Michal 1991 SAVMATEM - Matematický ústav SAV
    Co-authors Jirásek Jozef

    Jirásková Galina 1963 SAVMATEM - Matematický ústav SAV

    Šebej Juraj

    Source document Lecture Notes in Computer Science : Descriptional Complexity of Formal Systems DCFS 2023. Vol. 13918 (2023), pp. 79-93. - Heidelberg : Springer
    Languageeng - English
    CountryCH - Switzerland
    URLURL link
    Document kindrozpis článkov z periodík (rzb)
    CategoryADMB - Scientific papers in foreign non-impacted journals registered in Web of Sciences or Scopus
    Category of document (from 2022)V2 - Vedecký výstup publikačnej činnosti ako časť editovanej knihy alebo zborníka
    Type of documentkapitola
    Year2023
    Registered inSCOPUS
    DOI 10.1007/978-3-031-34326-1_6
    article

    article

    File nameAccessSizeDownloadedTypeLicense
    Operational Complexity NFAtoDFA TradeOff.pdfNeprístupný/archív333.8 KB0Publisher's version
    rok vydaniarok metrikyIFIF Q (best)SJRSJR Q (best)
    202320220.32Q3
Number of the records: 1  

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