Alexander Okhotin
Turun yliopisto
H-index: 26
Europe-Finland
Top articles of Alexander Okhotin
Title | Journal | Author(s) | Publication Date |
|---|---|---|---|
GF (2)-operations on basic families of formal languages | Theoretical Computer Science | Alexander Okhotin Maria Radionova Elizaveta Sazhneva | 2024/5/12 |
State complexity of transforming graph-walking automata to halting, returning and reversible | Information and Computation | Olga Martynova Alexander Okhotin | 2023/3/1 |
Check for updates Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2" Lower Bound | Descriptional Complexity of Formal Systems: 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023, Proceedings | Olga Martynova Alexander Okhotin | 2023/6/23 |
On the transformation of two-way finite automata to unambiguous finite automata | Information and Computation | Semyon Petrov Alexander Okhotin | 2023/12/1 |
The Hardest LL() Language | International Journal of Foundations of Computer Science | Mikhail Mrykhin Alexander Okhotin | 2023/2/6 |
Non-closure under complementation for unambiguous linear grammars | Information and Computation | Olga Martynova Alexander Okhotin | 2023/6/1 |
Homomorphisms and inverse homomorphisms on graph-walking automata | Theoretical Computer Science | Olga Martynova Alexander Okhotin | 2023/11/10 |
Parallel Enumeration of Parse Trees | Margarita Mikhelson Alexander Okhotin | 2023 | |
The hardest language for grammars with context operators | Theoretical Computer Science | Mikhail Mrykhin Alexander Okhotin | 2023/5/22 |
Sweeping permutation automata | arXiv preprint arXiv:2309.08723 | Maria Radionova Alexander Okhotin | 2023/9/15 |
Probabilistic Input-Driven Pushdown Automata | Alex Rose Alexander Okhotin | 2023 | |
Correction to: On the Transformation of LL(k)-linear to LL(1)-linear Grammars | Theory of Computing Systems | Ilya Olkhovsky Alexander Okhotin | 2023/4 |
A Time to Cast Away Stones | Olga Martynova Alexander Okhotin | 2023/8/10 | |
Rational index of languages defined by grammars with bounded dimension of parse trees | Theory of Computing Systems | Ekaterina Shemetova Alexander Okhotin Semyon Grigorev | 2023/12/20 |
On the Transformation of LL(k)-linear to LL(1)-linear Grammars | Theory of Computing Systems | Ilya Olkhovsky Alexander Okhotin | 2023/4 |
Shortest Accepted Strings for Two-Way Finite Automata: Approaching the Lower Bound | Olga Martynova Alexander Okhotin | 2023/6/24 | |
On the rank of the communication matrix for deterministic two-way finite automata | arXiv preprint arXiv:2312.05909 | Semyon Petrov Fedor Petrov Alexander Okhotin | 2023/12/10 |
Homomorphisms on graph-walking automata | Olga Martynova Alexander Okhotin | 2022/5/28 | |
Rational index of languages with bounded dimension of parse trees | Ekaterina Shemetova Alexander Okhotin Semyon Grigorev | 2022/5/6 | |
State complexity of GF (2)-operations on unary languages | Information and Computation | Alexander Okhotin Elizaveta Sazhneva | 2022/3/1 |
