Sergey M. Dudakov

According to our database, Sergey M. Dudakov authored at least 10 papers between 1997 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

On Decidability of Theories of Regular Languages.

Sergey M. Dudakov, Boris Karlov

Theory Comput. Syst., 2021

2019

On Safety of Unary and Nonunary IFP Operators.

Sergey M. Dudakov

Autom. Control. Comput. Sci., 2019

On Decidability of Regular Languages Theories.

Sergey M. Dudakov, Boris Karlov

Proceedings of the Computer Science - Theory and Applications, 2019

2006

Isolation and Reducibility Properties and the Collapse Result.

Sergey M. Dudakov

Proceedings of the Computer Science, 2006

2001

Maximal state independent approximations to minimal real change.

Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov, Nicolas Spyratos

Ann. Math. Artif. Intell., 2001

2000

Maximal Expansions of Database Updates.

Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov, Nicolas Spyratos

Proceedings of the Foundations of Information and Knowledge Systems, 2000

On Complexity of Updates through Integrity Constraints.

Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov

Proceedings of the Computational Logic, 2000

1999

On the Complexity of Perfect Models of Logic Programs.

Sergey M. Dudakov

Fundam. Informaticae, 1999

Monotone Expansion of Updates in Logical Databases.

Michael I. Dekhtyar, Alexander Ja. Dikovsky, Sergey M. Dudakov, Nicolas Spyratos

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

1997

The Concurrency Complexity for the Horn Fragment of Linear Logic.

Sergey M. Dudakov

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997