Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Coauthors
(19)
Artur Jez
11
Michal Kunc
7
Juhani Karhumaki (Juhani Karhumäki)
6
Michael Domaratzki
5
Kai Salomaa
5
Conferences
(11)
DLT
8
MFCS
4
ICALP
3
CIAA(WIA)
3
STACS
2
Journals
(17)
TCS
15
IJFCS
6
MST
5
FUIN
5
Grammars
4
Keywords
(57)
Embed
Subscribe
Academic
Authors
Alexander Okhotin
Alexander Okhotin,University of Turku,Algorithms & Theory,Natural Language & Speech,Scientific Computing
Edit
Alexander Okhotin
University of Turku
Publications:
110

Citations:
643
Fields:
Algorithms & Theory
,
Natural Language & Speech
,
Scientific Computing
View FAQ about top research areas and Fields of study
Collaborated with
19 coauthors
from 1991 to 2011

Cited by
118 authors
Cumulative
Annual
Sort by:
Publications
(110)
BibTeX

RIS

RefWorks
Download
Complexity of Equations over Sets of Natural Numbers
(
Citations: 5
)
Artur Jez
,
Alexander Okhotin
Journal:
Theory of Computing Systems / Mathematical Systems Theory  MST
, vol. 48, no. 2, pp. 319342, 2011
OneNonterminal Conjunctive Grammars over a Unary Alphabet
(
Citations: 2
)
Artur Jeż
,
Alexander Okhotin
Journal:
Theory of Computing Systems / Mathematical Systems Theory  MST
, vol. 49, no. 2, pp. 319342, 2011
Comparing Linear Conjunctive Languages to Subfamilies of the ContextFree Languages
(
Citations: 2
)
Alexander Okhotin
Conference:
Conference on Current Trends in Theory and Practice of Informatics  SOFSEM
, pp. 431443, 2011
A simple Pcomplete problem and its languagetheoretic representations
(
Citations: 1
)
Alexander Okhotin
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 12, pp. 6882, 2011
On Equations over Sets of Numbers and their Limitations
(
Citations: 1
)
Tommi Lehtinen
,
Alexander Okhotin
Journal:
International Journal of Foundations of Computer Science  IJFCS
, vol. 22, no. 2, pp. 377393, 2011
Sort by:
Citations
(643 times by 176 publications)
Undecidability of state complexity
Arto Salomaa
,
Kai Salomaa
,
Sheng Yu
Journal:
International Journal of Computer Mathematics  IJCM
, vol. aheadofp, no. aheadofp, pp. 111, 2012
Complexity of Equations over Sets of Natural Numbers
(
Citations: 5
)
Artur Jez
,
Alexander Okhotin
Journal:
Theory of Computing Systems / Mathematical Systems Theory  MST
, vol. 48, no. 2, pp. 319342, 2011
OneNonterminal Conjunctive Grammars over a Unary Alphabet
(
Citations: 2
)
Artur Jeż
,
Alexander Okhotin
Journal:
Theory of Computing Systems / Mathematical Systems Theory  MST
, vol. 49, no. 2, pp. 319342, 2011
Comparing Linear Conjunctive Languages to Subfamilies of the ContextFree Languages
(
Citations: 2
)
Alexander Okhotin
Conference:
Conference on Current Trends in Theory and Practice of Informatics  SOFSEM
, pp. 431443, 2011
A simple Pcomplete problem and its languagetheoretic representations
(
Citations: 1
)
Alexander Okhotin
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 12, pp. 6882, 2011
Comments