Alexander Okhotin
| Alexander Okhotin | |
|---|---|
| Born | 1978 (age 45–46) Russia |
| 🏡 Residence | Russia  Finland |
| 🎓 Alma mater | Moscow State University Queen's University |
| 💼 Occupation | |
| Known for | conjunctive grammars language equations |
Alexander Okhotin (born 1978) is a Russian theoretical computer scientist, known for his research in formal language theory, particularly for conjunctive grammars. He is a professor at St. Petersburg State University.
Biography[edit]
Okhotin earned his undergraduate degree from Moscow State University (2001) and his doctorate from Queen's University (2004). In 2004-2016, he was a researcher at the University of Turku. Since 2016, he is a full professor at St. Petersburg State University.
Research contributions[edit]
Okhotin introduced a new type of formal grammars with conjunction in their productions, the conjunctive grammars[1] which attracted citations and follow-up work.[2][3][4]
He also studied language equations[5][6] and contributed to the research on state complexity of finite automata[7] and visibly pushdown automata.[8]
References[edit]
- ↑ Okhotin, Alexander (2013). "Conjunctive and Boolean grammars: The true general case of the context-free grammars". Computer Science Review. 9: 27–59. doi:10.1016/j.cosrev.2013.06.001. ISSN 1574-0137.
- ↑ Kuznetsov, Stepan (2013). "Conjunctive Grammars in Greibach Normal Form and the Lambek Calculus with Additive Connectives". 8036: 242–249. doi:10.1007/978-3-642-39998-5_15. ISSN 0302-9743.
- ↑ Aizikowitz, Tamar; Kaminski, Michael (2016). "LR (0) conjunctive grammars and deterministic synchronized alternating pushdown automata". Journal of Computer and System Sciences. 82 (8): 1329–1359. doi:10.1016/j.jcss.2016.05.008. ISSN 0022-0000.
- ↑ Yoshinaka, Ryo (2015). "Learning Conjunctive Grammars and Contextual Binary Feature Grammars". 8977: 623–635. doi:10.1007/978-3-319-15579-1_49. ISSN 0302-9743.
- ↑ Okhotin, Alexander (2010). "Decision problems for language equations". Journal of Computer and System Sciences. 76 (3–4): 251–266. doi:10.1016/j.jcss.2009.08.002. ISSN 0022-0000.
- ↑ Jeż, Artur; Okhotin, Alexander (2014). "Computational completeness of equations over sets of natural numbers". Information and Computation. 237: 56–94. doi:10.1016/j.ic.2014.05.001. ISSN 0890-5401.
- ↑ Okhotin, Alexander (2012). "Unambiguous finite automata over a unary alphabet". Information and Computation. 212: 15–36. doi:10.1016/j.ic.2012.01.003. ISSN 0890-5401.
- ↑ Okhotin, Alexander; Salomaa, Kai (2017). "State complexity of operations on input-driven pushdown automata". Journal of Computer and System Sciences. 86: 207–228. doi:10.1016/j.jcss.2017.02.001. ISSN 0022-0000.
External links[edit]
- Lua error in Module:Official_website at line 90: attempt to index field 'wikibase' (a nil value).
- Alexander Okhotin at DBLP Bibliography Server
- Alexander Okhotin at the Mathematics Genealogy Project
This article "Alexander Okhotin" is from Wikipedia. The list of its authors can be seen in its historical. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
