Karlov Boris Nikolaevich
|
Associate professor
|
Candidate of physico-mathematical sciences (2012)
|
Speciality:
01.01.06 (Mathematical logic, algebra, and number theory)
E-mail:
Keywords: Formal grammar, decidability, computational complexity
Subject: Mathematical logic, theory of automata and formal languages, theory of computational complexity
Main publications:
-
Karlov B. N., “(m,n)-zhestkie kategorialnye grammatiki”, Vestnik Tverskogo gosudarstvennogo universiteta. Seriya: Prikladnaya matematika, 2017, № 4, 7-23
-
Karlov B. N., Naimushin A. V., “Ravnomernaya pourovnevaya ukladka grafov”, Vestnik Tverskogo gosudarstvennogo universiteta. Seriya: Prikladnaya matematika, 2018, № 2, 85-98
-
Dudakov S., Karlov B., “On Decidability of Regular Languages Theories”, Lecture Notes in Computer Science, 11532 LNCS, Springer-Verlag GmbH, 2019, 119-130
-
Dudakov S., Karlov B., “On Decidability of Theories of Regular Languages”, Theory of Computing Systems, 2020
-
Karlov B., “On Theory of Regular Languages with the Kleene Star Operation”, Lobachevskii Journal of Mathematics, 41:9 (2020), 1660-1665
Publications in Math-Net.Ru
© , 2024