Find Research outputs — Saint Petersburg State University

2020

Longer Shortest Strings in Two-Way Finite Automata

Крымский, С. Т. & Okhotin, A., 2020, Descriptional Complexity of Formal Systems - 22nd International Conference, 2020, Proceedings. Jirásková, G. & Pighizzini, G. (eds.). Springer Nature, p. 104-116 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12442 LNCS).

Research output › › peer-review

2019

On the expressive power of GF(2)-grammars

Makarov, V. & Okhotin, A., 1 Jan 2019, SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Královič, R., Pighizzini, G., Nawrocki, J. & Catania, B. (eds.). Springer Nature, p. 310-323 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11376 LNCS).

Research output › › peer-review

4 Citations (Scopus)

2017

Edit distance neighbourhoods of input-driven pushdown automata

Okhotin, A. & Salomaa, K., 2017, Computer Science – Theory and Applications: International Computer Science Symposium in Russia. p. 260-272 (Lecture Notes in Computer Science; vol. 10304).

Research output ›

6 Citations (Scopus)

2020

On the transformation of ll(k)-linear grammars to ll(1)-linear

Okhotin, A. & Olkhovsky, I., 1 Jun 2020, Computer Science – Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Proceedings. Fernau, H. (ed.). Springer Nature, p. 328-340 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12159 LNCS).

Research output › › peer-review

2015

Descriptional Complexity of Formal Systems

Shallit, J. & Okhotin, A., 1 Jan 2015, Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Proceedings. Okhotin, A. & Shallit, J. (eds.). Springer Nature, (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9118).

Research output › › peer-review

2011

Expressive power of LL(k) boolean grammars

Okhotin, A., 9 Sep 2011, In: Theoretical Computer Science. 412, 39, p. 5132-5155 24 p.

Research output › peer-review

Open Access

4 Citations (Scopus)

2015

Two-sided context specifications in formal grammars

Barash, M. & Okhotin, A., 2 Aug 2015, In: Theoretical Computer Science. 591, p. 134-153 20 p.

Research output › peer-review

7 Citations (Scopus)

2013

Homomorphisms preserving deterministic context-free languages

Lehtinen, T. & Okhotin, A., 1 Nov 2013, In: International Journal of Foundations of Computer Science. 24, 7, p. 1049-1066 18 p.

Research output › peer-review

2012

Non-erasing variants of the Chomsky-Schützenberger theorem

Okhotin, A., 20 Aug 2012, Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. p. 121-129 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7410 LNCS).

Research output › › peer-review

20 Citations (Scopus)

2019

State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages

Okhotin, A. & Sazhneva, E., 1 Jul 2019, Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. Konstantinidis, S., Hospodár, M. & Jirásková, G. (eds.). Springer Nature, p. 248-259 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11612 LNCS).

Research output › › peer-review

3 Citations (Scopus)

2013

Unambiguous conjunctive grammars over a one-letter alphabet

Jez, A. & Okhotin, A., 19 Sep 2013, Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings. p. 277-288 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7907 LNCS).

Research output › › peer-review

2 Citations (Scopus)

2019

Graph-Walking Automata: From Whence They Come, and Whither They are Bound

Okhotin, A., 1 Jul 2019, Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. Hospodár, M. & Jirásková, G. (eds.). Springer Nature, p. 10-29 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11601 LNCS).

Research output › › peer-review

2011

State complexity of union and intersection for two-way nondeterministic finite automata

Kunc, M. & Okhotin, A., 20 Sep 2011, In: Fundamenta Informaticae. 110, 1-4, p. 231-239 9 p.

Research output › peer-review

6 Citations (Scopus)

2020

Reversibility of computations in graph-walking automata

Kunc, M. & Okhotin, A., Dec 2020, In: Information and Computation. 275, 104631.

Research output › peer-review

2019

State complexity of unambiguous operations on finite automata

Jirásková, G. & Okhotin, A., 17 Dec 2019, In: Theoretical Computer Science. 798, p. 52-64

Research output › peer-review

3 Citations (Scopus)

Filters for Research output

Search results