Robert Ferens

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