If you made any changes in Pure these will be visible here soon.

Personal profile

Education/Academic qualification

PhD, Queen’s University

1 Sep 200131 Oct 2004

Candidate of Sciences, Moscow State University

20 Dec 2002

Fingerprint Dive into the research topics where Александр Сергеевич Охотин is active. These topic labels come from the works of this person. Together they form a unique fingerprint.

  • 2 Similar Profiles
Context free grammars Технические дисциплины и материаловедение
Grammar Математика
Formal languages Технические дисциплины и материаловедение
Finite automata Технические дисциплины и материаловедение
Concatenation Математика
State Complexity Математика
Automata Математика
Context-free Grammar Математика

Network Recent external collaboration on country level. Dive into details by clicking on the dots.

Projects 2019 2019

RSF_RG_2018 - 2: Логические и алгебраические методы в теории формальных языков: 2019 г. этап 2

Охотин, А. С., Григорьев, С. В., Пентус, М. Р., Селиванов, В. Л., Сорокин, А. А., Макаров, В. М., Сажнева, Е. А., Мрыхин, М. К., Азимов, Р. Ш. & Горохов, А. В.

1/01/1931/12/19

Project

Research Output 2002 2019

2 Citations (Scopus)

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

Context free languages
Pushdown Automata
Edit Distance
Formal languages
Strings

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

Finite automata
Automata
Graph in graph theory
Finite Automata
Navigation
Context free languages
Grammar
Context-free Languages
Homomorphic
Operator
1 Citation (Scopus)

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

Context free grammars
Formal languages
Concatenation
Expressive Power
Grammar

Activities 2019 2019

  • 1 Организация конференции, заседания рабочей группы, ...