Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEgor Vladimirovich Kuzmin
Person information
- affiliation: Demidov Yaroslavl State University, Yaroslavl, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j27]E. V. Kuzmin
:
Linear Temporal Logic Specification of Bounded Counter Machines. Autom. Control. Comput. Sci. 57(7): 683-695 (2023)- [j26]Leonid Y. Bystrov, E. V. Kuzmin:
The Application of Majority Voting Functions to Estimate the Number of Monotone Self-Dual Boolean Functions. Autom. Control. Comput. Sci. 57(7): 706-717 (2023) - 2022
- [j25]E. V. Kuzmin, Oleg E. Gorbunov, Petr O. Plotnikov, Vadim A. Tyukin, Vladimir A. Bashkin:
An Algorithm for Correcting Levels of Useful Signals on Interpretation of Eddy-Current Defectograms. Autom. Control. Comput. Sci. 56(7): 701-710 (2022) - [j24]E. V. Kuzmin:
LTL-Specification of Counter Machines. Autom. Control. Comput. Sci. 56(7): 711-722 (2022) - [j23]E. V. Kuzmin, Oleg E. Gorbunov, Petr O. Plotnikov, Vadim A. Tyukin, Vladimir A. Bashkin:
Assessing Flaw Severity on Interpretation of Eddy-Current Defectograms. Autom. Control. Comput. Sci. 56(7): 723-734 (2022) - 2021
- [j22]E. V. Kuzmin, Oleg E. Gorbunov, Petr O. Plotnikov, Vadim A. Tyukin, Vladimir A. Bashkin:
Application of Convolutional Neural Networks for Recognizing Long Structural Elements of Rails in Eddy Current Defectograms. Autom. Control. Comput. Sci. 55(7): 712-722 (2021)
2010 – 2019
- 2019
- [j21]E. V. Kuzmin, Oleg E. Gorbunov, Petr O. Plotnikov, Vadim A. Tyukin, Vladimir A. Bashkin:
Application of Neural Networks for Recognizing Rail Structural Elements in Magnetic and Eddy Current Defectograms. Autom. Control. Comput. Sci. 53(7): 628-637 (2019) - 2018
- [j20]Egor Vladimirovich Kuzmin, Oleg E. Gorbunov, Petr O. Plotnikov, Vadim A. Tyukin:
Finding the Level of Useful Signals on Interpretation of Magnetic and Eddy-Current Defectograms. Autom. Control. Comput. Sci. 52(7): 658-666 (2018) - [j19]E. V. Kuzmin, Oleg E. Gorbunov, Petr O. Plotnikov, Vadim A. Tyukin:
An Efficient Algorithm for Finding the Level of Useful Signals on Interpretation of Magnetic and Eddy Current Defectograms. Autom. Control. Comput. Sci. 52(7): 867-870 (2018) - 2017
- [j18]D. A. Ryabukhin, E. V. Kuzmin, Valery A. Sokolov:
Construction of CFC-Programs by LTL-Specification. Autom. Control. Comput. Sci. 51(7): 567-575 (2017) - 2016
- [j17]E. V. Kuzmin, D. A. Ryabukhin, Valery A. Sokolov:
On the expressiveness of the approach to constructing PLC-programs by LTL-specification. Autom. Control. Comput. Sci. 50(7): 510-519 (2016) - 2015
- [j16]E. V. Kuzmin, Valery A. Sokolov, D. A. Ryabukhin:
Construction and verification of PLC-programs by LTL-specification. Autom. Control. Comput. Sci. 49(7): 453-465 (2015) - 2014
- [j15]E. V. Kuzmin, Valery A. Sokolov, D. A. Ryabukhin:
Construction and verification of PLC LD programs by the LTL specification. Autom. Control. Comput. Sci. 48(7): 424-436 (2014) - [j14]E. V. Kuzmin, Valery A. Sokolov:
Modeling, specification and construction of PLC-programs. Autom. Control. Comput. Sci. 48(7): 554-563 (2014) - [j13]E. V. Kuzmin, D. A. Ryabukhin, Valery A. Sokolov:
Modeling a consistent behavior of PLC-sensors. Autom. Control. Comput. Sci. 48(7): 602-614 (2014) - 2013
- [j12]E. V. Kuzmin, Valery A. Sokolov:
On construction and verification of PLC programs. Autom. Control. Comput. Sci. 47(7): 443-451 (2013) - [j11]E. V. Kuzmin, Valery A. Sokolov:
The modeling of counter machines by two-head finite automata. Autom. Control. Comput. Sci. 47(7): 541-544 (2013) - 2011
- [j10]E. V. Kuzmin, D. Ju. Chalyy:
On the reachability set of automaton counter machines. Autom. Control. Comput. Sci. 45(7): 444-451 (2011) - [j9]E. V. Kuzmin, D. Ju. Chalyy:
On languages of automaton counter machines. Autom. Control. Comput. Sci. 45(7): 469-484 (2011) - 2010
- [j8]E. V. Kuzmin, D. Ju. Chalyy:
Algorithms for the boundedness problem for Minsky counter machines. Autom. Control. Comput. Sci. 44(7): 365-373 (2010) - [j7]E. V. Kuzmin, D. Ju. Chalyy:
Decidability of boundedness problems for Minsky counter machines. Autom. Control. Comput. Sci. 44(7): 387-397 (2010) - [j6]E. V. Kuzmin, D. Ju. Chalyy:
On a reachability set of automation 3-counter machines. Autom. Control. Comput. Sci. 44(7): 415-419 (2010) - [j5]E. V. Kuzmin, D. Ju. Chalyy:
On one class of counter machines. Autom. Control. Comput. Sci. 44(7): 447-451 (2010) - [j4]E. V. Kuzmin:
Boundedness problem for lossy counter machines. Autom. Control. Comput. Sci. 44(7): 455-466 (2010) - [j3]E. V. Kuzmin, Valery A. Sokolov, D. Ju. Chalyy:
Boundedness problems for Minsky counter machines. Program. Comput. Softw. 36(1): 3-10 (2010)
2000 – 2009
- 2009
- [j2]E. V. Kuzmin, Valery A. Sokolov, D. Ju. Chalyy:
Application of the trace assertion method to the specification, design, and verification of automaton programs. Program. Comput. Softw. 35(1): 43-55 (2009) - 2008
- [j1]E. V. Kuzmin, Valery A. Sokolov:
Modeling, specification, and verification of automaton programs. Program. Comput. Softw. 34(1): 27-43 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
