Number of the records: 1
The Ranges of Accepting State Complexities of Languages Resulting from Some Operations
Title The Ranges of Accepting State Complexities of Languages Resulting from Some Operations Author Hospodár Michal 1991 SAVMATEM - Matematický ústav SAV Co-authors Holzer Markus Source document International Journal of Foundations of Computer Science. Vol. 31, no. 8 (2020), p. 1159-1177 Language eng - English Document kind rozpis článkov z periodík (rbx) Citations DASSOW, Juergen. Further Remarks on the Operational Nonterminal Complexity. In INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. ISSN 0129-0541, 2021, vol. 32, no. 05, pp. 439-453. NAGY, Benedek. Operational union-complexity. In Information and Computation. ISSN 08905401, 2022-03-01, 2022, no. 284, art. nr. 104692. Dostupné na: https://doi.org/10.1016/j.ic.2021.104692. OLEJÁR, Viktor - SZABARI, Alexander. Closure Properties of Subregular Languages Under Operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2022-01-01, 13419 LNCS, pp. 126-142. ISSN 03029743. Dostupné na: https://doi.org/10.1007/978-3-031-13502-6_9. Category ADCA - 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 Year 2020 Registered in WOS Registered in SCOPUS Registered in CCC DOI 10.1142/S0129054120420083 article
File name Access Size Downloaded Type License The Ranges of Accepting State Complexities.pdf Neprístupný/archív 350.4 KB 7 Publisher's version rok CC IF IF Q (best) JCR Av Jour IF Perc SJR SJR Q (best) CiteScore A rok vydania rok metriky IF IF Q (best) SJR SJR Q (best) 2020 2019 0.523 Q4 0.334 Q2
Number of the records: 1