Attainable Values of Reset Thresholds. - Michalina Dzyga; Robert Ferens; Vladimir V. Gusev; Marek Szykula (MFCS, 2017)

Extending word problems in deterministic finite automata. - Mikhail V. Berlinkov; Robert Ferens; Marek Szykula (CoRR, 2017)

Complexity of regular bifix-free languages. - Robert Ferens; Marek Szykula (CoRR, 2017)

Complexity of Preimage Problems for Deterministic Finite Automata. - Mikhail V. Berlinkov; Robert Ferens; Marek Szykula (MFCS, 2018)

Complexity of bifix-free regular languages. - Robert Ferens; Marek Szykula (Theor. Comput. Sci., 2019)

All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs. - Bartosz Bednarczyk; Robert Ferens; Piotr Ostropolski-Nalewaja (IJCAI, 2020)

Lower Bounds on Avoiding Thresholds. - Robert Ferens; Marek Szykula; Vojtech Vorel (MFCS, 2021)

Synchronizing Strongly Connected Partial DFAs. - Mikhail V. Berlinkov; Robert Ferens; Andrew Ryzhikov; Marek Szykula (STACS, 2021)

Solving One Variable Word Equations in the Free Group in Cubic Time. - Robert Ferens; Artur Jez (STACS, 2021)

Preimage problems for deterministic finite automata. - Mikhail V. Berlinkov; Robert Ferens; Marek Szykula (J. Comput. Syst. Sci., 2021)

Completely Reachable Automata: A Polynomial Solution and Quadratic Bounds for the Subset Reachability Problem. - Robert Ferens; Marek Szykula (CoRR, 2022)

Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds. - Robert Ferens; Marek Szykula (ICALP, 2023)