Alexander Okhotin - UTU Research Portal - UTU Research Portal

Go to Header Go to Navigation Go to Content Go to Footer

Alexander Okhotin

- Docent,
Department of Mathematics and Statistics (Faculty of Science)

alexander.okhotin@utu.fi

Go to first page

Go to previous page

5 of 7

Go to next page

Go to last page

Parsing Boolean grammars over a one-letter alphabet using online convolution (2012)
- Theoretical Computer Science
Okhotin A, Reitwiessner C
Representing Hyper-arithmetical Sets by Equations over Sets of Integers (2012)
- Theory of Computing Systems
Jez A, Okhotin A
Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints (2012)
- Lecture Notes in Computer Science
Baader F, Okhotin A
State complexity of operations on two-way finite automata over a unary alphabet (2012)
- Theoretical Computer Science
Kunc M, Okhotin A
Unambiguous finite automata over a unary alphabet (2012)
- Information and Computation
Okhotin A
A simple P-complete problem and its language-theoretic representations (2011)
- Theoretical Computer Science
Okhotin A
Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (2011)
- Lecture Notes in Computer Science
SOFSEM 2011:Theory and Practice of Computer Science Okhotin A
Complexity of Equations over Sets of Natural Numbers (2011)
- Theory of Computing Systems
Jez A, Okhotin A
Describing periodicity in two-way deterministic finite automata using transformation semigroups (2011)
- Lecture Notes in Computer Science
Developments in in Language Theory (DLT 2011) Kunc Michal, Okhotin Alexander
Descriptional Complexity of Unambiguous Nested Word Automata (2011)
- Lecture Notes in Computer Science
Language and Automata Theory and Applications (LATA 2011) Okhotin A, Salomaa K