Robert Ferens

Publication Activity (10 Years)

Years Active: 2017-2023
Publications (10 Years): 15

Top Topics

Deterministic Finite Automata

Top Venues

J. Comput. Syst. Sci.

Publications

Robert Ferens, Marek Szykula
Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds. ICALP (2023)
Robert Ferens, Marek Szykula
Completely Reachable Automata: A Polynomial Solution and Quadratic Bounds for the Subset Reachability Problem. CoRR (2022)
Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Preimage problems for deterministic finite automata. J. Comput. Syst. Sci. 115 (2021)
Robert Ferens, Artur Jez
Solving one variable word equations in the free group in cubic time. CoRR (2021)
Robert Ferens, Marek Szykula, Vojtech Vorel
Lower Bounds on Avoiding Thresholds. MFCS (2021)
Robert Ferens, Artur Jez
Solving One Variable Word Equations in the Free Group in Cubic Time. STACS (2021)
Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula
Synchronizing Strongly Connected Partial DFAs. STACS (2021)
Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula
Synchronizing Strongly Connected Partial DFAs. CoRR (2021)
Bartosz Bednarczyk, Robert Ferens, Piotr Ostropolski-Nalewaja
All-Instances Oblivious Chase Termination is Undecidable for Single-Head Binary TGDs. IJCAI (2020)
Robert Ferens, Marek Szykula
Complexity of bifix-free regular languages. Theor. Comput. Sci. 787 (2019)
Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Complexity of Preimage Problems for Deterministic Finite Automata. MFCS (2018)
Michalina Dzyga, Robert Ferens, Vladimir V. Gusev, Marek Szykula
Attainable Values of Reset Thresholds. MFCS (2017)
Mikhail V. Berlinkov, Robert Ferens, Marek Szykula
Extending word problems in deterministic finite automata. CoRR (2017)
Robert Ferens, Marek Szykula
Complexity of regular bifix-free languages. CoRR (2017)
Robert Ferens, Marek Szykula
Complexity of Bifix-Free Regular Languages. CIAA (2017)