Robert Ferens
From MaRDI portal
Person:2208256
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Completely reachable automata: a polynomial algorithm and quadratic upper bounds | 2024-11-14 | Paper |
| Lower Bounds on Avoiding Thresholds | 2023-08-08 | Paper |
| Complexity of preimage problems for deterministic finite automata | 2021-08-04 | Paper |
| Solving one variable word equations in the free group in cubic time | 2021-01-15 | Paper |
| Synchronizing Strongly Connected Partial DFAs | 2021-01-13 | Paper |
| Preimage problems for deterministic finite automata Journal of Computer and System Sciences | 2020-10-23 | Paper |
| Attainable values of reset thresholds | 2020-05-26 | Paper |
| Complexity of bifix-free regular languages Theoretical Computer Science | 2019-08-20 | Paper |
| Complexity of bifix-free regular languages Implementation and Application of Automata | 2017-08-22 | Paper |
Research outcomes over time
This page was built for person: Robert Ferens
