Alexander Okhotin
Publications 
5 of 7
- Parsing Boolean grammars over a one-letter alphabet using online convolution (2012)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Representing Hyper-arithmetical Sets by Equations over Sets of Integers (2012)
- Theory of Computing Systems
(A1 Refereed original research article in a scientific journal) - Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints (2012)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - State complexity of operations on two-way finite automata over a unary alphabet (2012)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Unambiguous finite automata over a unary alphabet (2012)
- Information and Computation
(A1 Refereed original research article in a scientific journal) - A simple P-complete problem and its language-theoretic representations (2011)
- Theoretical Computer Science
(A1 Refereed original research article in a scientific journal) - Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (2011)
- Lecture Notes in Computer Science
(A1 Refereed original research article in a scientific journal) - Complexity of Equations over Sets of Natural Numbers (2011)
- Theory of Computing Systems
(A1 Refereed original research article in a scientific journal) - Describing periodicity in two-way deterministic finite automata using transformation semigroups (2011)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication ) - Descriptional Complexity of Unambiguous Nested Word Automata (2011)
- Lecture Notes in Computer Science
(A4 Refereed article in a conference publication )
UTU Research Portal