Projects per year
Personal profile
Education/Academic qualification
PhD, Queen’s University
1 Sep 2001 → 31 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
- 1 Active
RSF_RG_2018 - 2: Логические и алгебраические методы в теории формальных языков: 2019 г. этап 2
Охотин, А. С., Григорьев, С. В., Пентус, М. Р., Селиванов, В. Л., Сорокин, А. А., Макаров, В. М., Сажнева, Е. А., Мрыхин, М. К., Азимов, Р. Ш. & Горохов, А. В.
1/01/19 → 31/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
Hardest languages for conjunctive and Boolean grammars
Okhotin, A., 1 Jun 2019, In : Information and Computation. 266, p. 1-18 18 p.Research output
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 output › › peer-review
Context free grammars
Formal languages
Concatenation
Expressive Power
Grammar
Preface
Martín-Vide, C., Shapira, D. & Okhotin, A., 1 Jan 2019, In : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 11417 LNCS, p. VResearch output
Activities 2019 2019
- 1 Организация конференции, заседания рабочей группы, ...
13th International Conference on Language and Automata Theory and Applications, LATA 2019
Александр Сергеевич Охотин (Chair), Carlos Martín-Vide (Chair)26 Mar 2019 → 29 Mar 2019
Activity