Number of the records: 1  

The complexity of languages resulting from the concatenation operation

  1. TitleThe complexity of languages resulting from the concatenation operation
    Author Jirásková Galina 1963 SAVMATEM - Matematický ústav SAV
    Co-authors Szabari Alexander

    Šebej Juraj

    Source document Lecture Notes in Computer Science : Descriptional Complexity of Formal Systems. Vol. 9777 (2016), p. 153-167
    Languageeng - English
    Note18th IFIP WG 1.2. International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016
    Document kindrozpis článkov z periodík (rzb)
    CitationsHOLZER, Markus - HOSPODÁR, Michal. The Range of State Complexities of Languages Resulting from the Cut Operation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ISSN 03029743, 2019-01-01, 11417 LNCS, p. 190-202.
    HOSPODAR, Michal - HOLZER, Markus. The Ranges of Accepting State Complexities of Languages Resulting from Some Operations. In INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. ISSN 0129-0541, 2020, vol. 31, no. 8, p. 1159-1177.
    CategoryADMB - Scientific papers in foreign non-impacted journals registered in Web of Sciences or Scopus
    Category of document (from 2022)V3 - Vedecký výstup publikačnej činnosti z časopisu
    Type of documentčlánok
    Year2016
    Registered inSCOPUS
    DOI 10.1007/978-3-319-41114-9_12
    article

    article

    rokCCIFIF Q (best)JCR Av Jour IF PercSJRSJR Q (best)CiteScore
    N
    rok vydaniarok metrikyIFIF Q (best)SJRSJR Q (best)
    201620150.369Q2
Number of the records: 1  

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