Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Sergey Mikhailovich Dudakov
Observed names:
S M Dudakov,
S. M. Dudakov,
Sergey Dudakov,
Sergey M Dudakov,
Sergey M. Dudakov,
Дудаков, С.М.
show all 6
Institutions:
National Research University Higher School of Economics,
Tver State University
Observed institutions:
Université Paris-Sud,
National Research University Higher School of Economics,
Centre National de la Recherche Scientifique,
Tver State University,
Laboratoire de Recherche en Informatique,
Keldysh Institute of Applied Mathematics
show all 6
ORCID:
0000-0003-2659-265X
Observed ORCID:
0000-0003-2659-265X
OpenAlex ID:
A5031843383
Трансляционные результаты для языков запросов в теории баз данных
2006
·
Сергей Михайлович Дудаков
, Sergey Mikhailovich Dudakov
, et al.
·
Успехи математических наук
·
15
PDF
On Undecidability of Concatenation Theory for One-Symbol Languages
2020
·
S. M. Dudakov
·
Lobachevskii Journal of Mathematics
·
13
Collapse results for query languages in database theory
2006
·
S M Dudakov
, M A Taitslin
·
Russian Mathematical Surveys
·
13
On Decidability of Theories of Regular Languages
2020
·
Sergey Dudakov
, Boris Karlov
·
Theory of Computing Systems
·
12
On Undecidability of Subset Theory for Some Monoids
2021
·
S M Dudakov
·
Journal of Physics Conference Series
·
8
PDF
On algorithmic properties of finite subset algebra for some unoids
2019
·
Sergey Mikhailovich Dudakov
·
Herald of Tver State University Series Applied Mathematics
·
8
PDF
Monotone Expansion of Updates in Logical Databases
1999
·
Michael Dekhtyar
, Alexander Dikovsky
, et al.
·
Lecture notes in computer science
·
8
On Undecidability of Finite Subsets Theory for Torsion Abelian Groups
2022
·
Sergey Mikhailovich Dudakov
·
Mathematics
·
7
PDF
On inflationary fix-point operators safety
2015
·
Sergey M. Dudakov
·
Lobachevskii Journal of Mathematics
·
7
Трансляционный результат для расширений арифметики Пресбургера одноместной функцией, согласованной со сложением
2004
·
Сергей Михайлович Дудаков
, Sergey Mikhailovich Dudakov
·
Математические заметки
·
7
PDF
Maximal Expansions of Database Updates
2000
·
Michael Dekhtyar
, Alexander Dikovsky
, et al.
·
Lecture notes in computer science
·
7
On Decidability of Regular Languages Theories
2019
·
Sergey Dudakov
, Boris Karlov
·
Lecture notes in computer science
·
6
Трансляционная теорема для теорий $I$-сводимых алгебраических систем
2004
·
Сергей Михайлович Дудаков
, Sergey Mikhailovich Dudakov
·
Известия Российской академии наук Серия математическая
·
6
PDF
On Safety of Unary and Nonunary IFP Operators
2019
·
S. M. Dudakov
·
Automatic Control and Computer Sciences
·
5
Collapse Result for Extensions of the Presburger Arithmetic by a Unary Function Compatible with Addition
2004
·
S. M. Dudakov
·
Mathematical Notes
·
5
On undecidability degree of theory of figures in linear spaces
2025
·
S. M. Dudakov
·
Mathematics and Theoretical Computer Science
·
4
PDF
The collapse theorem for theories of I -reducible algebraic systems
2004
·
S M Dudakov
·
Izvestiya Mathematics
·
4
Problems of algorithmic decidability and axiomatizability of finite subset algebra for binary operations
2025
·
Sergey Mikhailovich Dudakov
·
Izvestiya Mathematics
·
3
PDF
Complexity of Lambek Calculi with Modalities and of Total Derivability in Grammars
2021
·
S. M. Dudakov
, B. N. Karlov
, et al.
·
Algebra and Logic
·
2
Monadic structures over an ordered universal random graph and finite automata
2011
·
Sergey M Dudakov
·
Izvestiya Mathematics
·
2
Монадические состояния над упорядоченным универсальным случайным графом и конечные автоматы
2011
·
Сергей Михайлович Дудаков
, Sergey Mikhailovich Dudakov
·
Известия Российской академии наук Серия математическая
·
2
Разрешимая теория без трансляционной теоремы
2005
·
Дудаков, С.М.
·
Tver State University Repository (Tver State University)
·
2
Maximal state independent approximations to minimal real change
2001
·
Michael Dekhtyar
, Alexander Dikovsky
, et al.
·
Annals of Mathematics and Artificial Intelligence
·
2
On Complexity of Updates through Integrity Constraints
2000
·
Michael Dekhtyar
, Alexander Dikovsky
, et al.
·
Lecture notes in computer science
·
2
On the Complexity of Perfect Models of Logic Programs
1999
·
Sergey M. Dudakov
·
Fundamenta Informaticae
·
2
Show more works
View as search
Works count:
36
Citation count:
158
H-index:
7
I10-index:
4
Year
Topic
Type