Classical problems in the theory of finite automata: new approaches, variants, and applications

2017/25/B/ST6/01920

Keywords

Descriptors

  • ST6_4: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna
  • ST1_15: Matematyczne aspekty informatyki
  • ST6_7: Sztuczna inteligencja, systemy inteligentne i wieloagentowe

Panel

ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution

Uniwersytet Wrocławski, Wydział Matematyki i Informatyki

Voivodeship: dolnośląskie

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr Marek Szykuła

Number of co-investigators in the project: 5

Call

OPUS 13 – announced on 2017-03-15

Amount awarded
520 400 PLN
Project start date
2018-01-19
Project end date
2021-07-18
Project duration
42 months (the same as in the proposal)
Project status
Project settled

Project description

Download the project description in a pdf file

Note — project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Equipment purchased [PL]

  1. Komputer stacjonarny.
  2. Laptop. Cost: 8 000 PLN

Information in the final report

Publication in academic press/journals (4)

  1. Preimage problems for deterministic finite automata

    Authors:
    Mikhail V. Berlinkov, Robert Ferens, Marek Szykuła
    Academic press:
    Journal of Computer and System Sciences (year: 2021, volume: 115, pages: 214-234), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.jcss.2020.08.002 – link to the publication
  2. The Frobenius and Factor Universality Problems of the Kleene Star of a Finite Set of Words

    Authors:
    Maksymilian Mika, Marek Szykuła
    Academic press:
    Journal of the ACM (year: 2021, volume: 68, pages: 18:1--18:22), Publisher: Association for Computing Machinery
    Status:
    Published
    DOI:
    10.1145/3447237 – link to the publication
  3. Complexity of bifix-free regular languages

    Authors:
    Robert Ferens, Marek Szykuła
    Academic press:
    Theoretical Computer Science (year: 2019, volume: 787, pages: 14--27), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2018.09.016 – link to the publication
  4. Syntactic complexity of bifix-free regular languages

    Authors:
    Marek Szykuła, John Wittnebel
    Academic press:
    Theoretical Computer Science (year: 2019, volume: 787, pages: 45--76), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2018.12.025 – link to the publication

Articles in post-conference publications (11)

  1. Synchronizing Strongly Connected Partial DFAs

    Authors:
    Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykuła
    Conference:
    Symposium on Theoretical Aspects of Computer Science (STACS 2021) (year: 2021, pages: 12:1--12:16), Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
    Date:
    conference 2021.03.16--2021.03.19
    Status:
    Published
    DOI:
    link to the publication
  2. Efficient Reasoning in Regular Boardgames

    Authors:
    Jakub Kowalski, Radosław Miernik, Maksymilian Mika, Wojciech Pawlik, Jakub Sutowicz, Marek Szykuła, Andrzej Tkaczyk
    Conference:
    IEEE Conference on Games (CoG 2020) (year: 2020, pages: 455--462), Publisher: IEEE
    Date:
    conference 24.08.2020--27.08.2020
    Status:
    Published
  3. Lower Bounds on Avoiding Thresholds

    Authors:
    Robert Ferens, Marek Szykuła, Vojtěch Vorel
    Conference:
    46rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (year: 2021, pages: 46:1--46:14), Publisher: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, Dagstuhl, Germany
    Date:
    conference 2021.08.23--2021.08.27
    Status:
    Published
  4. Evolutionary Approach to Collectible Arena Deckbuilding using Active Card Game Genes

    Authors:
    Jakub Kowalski, Radosław Miernik
    Conference:
    2020 IEEE Congress on Evolutionary Computation (CEC) (year: 2020, pages: --), Publisher: IEEE
    Date:
    conference 2020.07.19--2020.07.24
    Status:
    Published
  5. Improving the Upper Bound on the Length of the Shortest Reset Words

    Authors:
    Marek Szykuła
    Conference:
    35th Symposium on Theoretical Aspects of Computer Science (STACS 2018) (year: 2018, pages: 56:1--56:13), Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
    Date:
    conference 28.02.2018--3.03.2018
    Status:
    Published
    DOI:
    link to the publication
  6. Regular Language Inference for Learning Rules of Simplified Boardgames

    Authors:
    Jakub Kowalski, Andrzej Kisielewicz
    Conference:
    IEEE Conference on Computational Intelligence and Games (CIG) (year: 2018, pages: 78--85), Publisher: IEEE
    Date:
    conference 14.08.2018 -- 17.08.2018
    Status:
    Published
  7. Existential Length Universality

    Authors:
    Paweł Gawrychowski, Martin Lange, Narad Rampersad, Jeffrey Shallit, Marek Szykuła
    Conference:
    37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020) (year: 2020, pages: 16:1--16:14), Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany
    Date:
    conference 2020-03-10 -- 2020-03-13
    Status:
    Published
  8. Experimental Studies in General Game Playing: An Experience Report

    Authors:
    Jakub Kowalski, Marek Szykuła
    Conference:
    AAAI 2020 Workshop on Reproducible AI (RAI@AAAI 2020) (year: 2020, pages: --), Publisher: --
    Date:
    conference 43868
    Status:
    Published
  9. Regular Boardgames

    Authors:
    Jakub Kowalski, Maksymilian Mika, Jakub Sutowicz, Marek Szykuła
    Conference:
    AAAI Conference on Artificial Intelligence (year: 2019, pages: 1699--1706), Publisher: AAAI Press
    Date:
    conference 27.01.2019 -- 1.02.2019
    Status:
    Published
    DOI:
    link to the publication
  10. Finding Short Synchronizing Words for Prefix Codes

    Authors:
    Andrew Ryzhikov, Marek Szykuła
    Conference:
    43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) (year: 2018, pages: 21:1--21:14), Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany
    Date:
    conference 27.08.2018--31.08.2018
    Status:
    Published
    DOI:
    link to the publication
  11. Complexity of Preimage Problems for Deterministic Finite Automata

    Authors:
    Mikhail V. Berlinkov, Robert Ferens, Marek Szykuła
    Conference:
    43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) (year: 2018, pages: 32:1--32:14), Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany
    Date:
    conference 27.08.2018--31.08.2018
    Status:
    Published
    DOI:
    link to the publication

« New search

Graphic design and implementation: Jakub Piotrowski