Search results

Records found: 5  
Your query: All Fields = "VEGA 2 0096 23"
  1. TitleOperations on Boolean and Alternating Finite Automata
    Author Jirásková Galina 1963 SAVMATEM - Matematický ústav SAV
    Action VEGA 2/0096/23. Automaty a formálne jazyky: popisná a výpočtová zložitosť : 2023-2026
    16th International Conference on Automata and Formal Languages ( 16th : September 5-7, 2023 : Eger, Hungary )
    Source document Electronic Proceedings in Theoretical Computer Science : Proceedings of the 16th International Conference on Automata and Formal Languages. Vol. 386 (2023), pp. 3-10
    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 documentpríspevok z podujatia
    Year2023
    DOI 10.4204/EPTCS.386.1
    URLURL link
    File nameAccessSizeDownloadedTypeLicense
    Operations on Boolean and Alternating Finite Automata.pdfNeprístupný/archív216.8 KB0Publisher's version
    article

    article

  2. TitleOperational Complexity in Subregular Classes
    Author Hospodár Michal 1991 SAVMATEM - Matematický ústav SAV
    Co-authors Jirásková Galina 1963 SAVMATEM - Matematický ústav SAV
    Action VEGA 2/0096/23. Automaty a formálne jazyky: popisná a výpočtová zložitosť : 2023-2026
    Source document Lecture Notes in Computer Science : Implementation and Application of Automata CIAA 2023. Vol. 14151 (2023), pp. 153-165. - Heidelberg : Springer
    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
    DOI 10.1007/978-3-031-40247-0_11
    URLURL link
    File nameAccessSizeDownloadedTypeLicense
    Operational Complexity in Subregular Classes.pdfNeprístupný/archív317.5 KB0Publisher's version
    article

    article

  3. 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
    Action VEGA 2/0096/23. Automaty a formálne jazyky: popisná a výpočtová zložitosť : 2023-2026
    Source document Lecture Notes in Computer Science : Descriptional Complexity of Formal Systems DCFS 2023. Vol. 13918 (2023), pp. 79-93. - Heidelberg : Springer
    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
    DOI 10.1007/978-3-031-34326-1_6
    URLURL link
    File nameAccessSizeDownloadedTypeLicense
    Operational Complexity NFAtoDFA TradeOff.pdfNeprístupný/archív333.8 KB0Publisher's version
    article

    article

  4. TitleThe cut operation in subclasses of convex languages
    Author Hospodár Michal 1991 SAVMATEM - Matematický ústav SAV
    Co-authors Olejár Viktor SAVMATEM - Matematický ústav SAV
    Action VEGA 2/0096/23. Automaty a formálne jazyky: popisná a výpočtová zložitosť : 2023-2026
    Source document Theoretical Computer Science. Vol. 969 (2023), art. nr. 114050
    CategoryADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted)
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year2023
    DOI 10.1016/j.tcs.2023.114050
    URLURL link
    File nameAccessSizeDownloadedTypeLicense
    The Cut Operation in Subclasses of Convex Languages.pdfNeprístupný/archív772.5 KB0Publisher's version
    article

    article

  5. TitleNondeterministic operational complexity in subregular languages
    Author Hospodár Michal 1991 SAVMATEM - Matematický ústav SAV
    Co-authors Olejár Viktor SAVMATEM - Matematický ústav SAV
    Action VEGA 2/0096/23. Automaty a formálne jazyky: popisná a výpočtová zložitosť : 2023-2026
    Source document Theoretical Computer Science. Vol. 972 (2023), art. nr. 114075
    CategoryADCA - Scientific papers in foreign journals registered in Current Contents Connect with IF (impacted)
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year2023
    DOI 10.1016/j.tcs.2023.114075
    URLURL link
    File nameAccessSizeDownloadedTypeLicense
    Nondeterministic operational complexity in subregular languages.pdfNeprístupný/archív605.8 KB0Publisher's version
    article

    article



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