Find Research Outputs

Search concepts
Selected filters

Publication Year

  • 2019
  • 2018
  • 2016
  • 2015

Author

  • Александр Сергеевич Охотин
2015

Descriptional Complexity of Formal Systems: 17th International Workshop, DCFS 2015 Waterloo, ON, Canada, June 25-27, 2015 Proceedings

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

Research output

Open Access
12 Citations (Scopus)

Generalized LR parsing for grammars with contexts

Barash, M. & Okhotin, A., 1 Jan 2015, Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Proceedings. Beklemishev, L. D., Musatov, D. V. & Musatov, D. V. (eds.). Springer, p. 67-79 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9139).

Research outputpeer-review

2 Citations (Scopus)
4 Citations (Scopus)
4 Citations (Scopus)

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

6 Citations (Scopus)
2016

Approximate unification in the description logic FL0

Baader, F., Marantidis, P. & Okhotin, A., 2016, In : Lecture Notes in Computer Science. 10021, p. 49-63

Research output

2 Citations (Scopus)

Computational and proof complexity of partial string avoidability

Itsykson, D., Okhotin, A. & Oparin, V., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

Research outputpeer-review

Descriptional Complexity of Formal Systems

Jürgensen, H., Karhumäki, J. & Okhotin, A., 11 Jan 2016, In : Theoretical Computer Science. 610, 1 p.

Research output

10 Citations (Scopus)
1 Citation (Scopus)
2018

A Tale of Conjunctive Grammars

Okhotin, A., 1 Sep 2018, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer, p. 36-59 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

Research outputpeer-review

2 Citations (Scopus)

Formal Languages over GF(2)

Bakinova, E., Basharin, A., Batmanov, I., Lyubort, K., Okhotin, A. & Sazhneva, E., 1 Jan 2018, Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings. Springer, p. 68-79 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10792 LNCS).

Research outputpeer-review

5 Citations (Scopus)

Further closure properties of input-driven pushdown automata

Okhotin, A. & Salomaa, K., 1 Jan 2018, Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. Springer, p. 224-236 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10952 LNCS).

Research outputpeer-review

1 Citation (Scopus)

Linear-space recognition for grammars with contexts

Barash, M. & Okhotin, A., 6 Apr 2018, In : Theoretical Computer Science. 719, p. 73-85 13 p.

Research output

1 Citation (Scopus)

Preface

Kari, J. & Okhotin, A., 1 Jun 2018, In : International Journal of Foundations of Computer Science. 29, 4, p. 457-459 3 p.

Research output

Preface

Shallit, J. & Okhotin, A., 1 Apr 2018, In : Information and Computation. 259, 1 p.

Research output

State complexity of unambiguous operations on deterministic finite automata

Jirásková, G. & Okhotin, A., 1 Jan 2018, Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. Springer, p. 188-199 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10952 LNCS).

Research outputpeer-review

1 Citation (Scopus)

Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata

Jirásková, G. & Okhotin, A., 1 Jan 2018, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer, p. 441-452 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

Research outputpeer-review

1 Citation (Scopus)

Underlying Principles and Recurring Ideas of Formal Grammars

Okhotin, A., 1 Jan 2018, Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings. Springer, p. 36-59 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10792 LNCS).

Research outputpeer-review

2 Citations (Scopus)
2019

Edit distance neighbourhoods of input-driven pushdown automata

Okhotin, A. & Salomaa, K., 19 Jul 2019, In : Theoretical Computer Science. 777, p. 417-430 14 p.

Research output

2 Citations (Scopus)

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, 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

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, 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 outputpeer-review

1 Citation (Scopus)

On the length of shortest strings accepted by two-way finite automata

Dobronravov, E., Dobronravov, N. & Okhotin, A., 1 Jan 2019, Developments in Language Theory - 23rd International Conference, DLT 2019, Proceedings. Hofman, P. & Skrzypczak, M. (eds.). Springer, p. 88-99 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11647 LNCS).

Research output

Preface

Martín-Vide, C., Shapira, D. & Okhotin, A., 1 Jan 2019, 13th International Conference on Language and Automata Theory and Applications. Vol. 11417 LNCS. p. V (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Research output

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, 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