Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry S. Ananichev
Person information
- affiliation: Ural Federal University, Institute of Mathematics and Computer Science, Ekaterinburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j7]Dmitry S. Ananichev, Vojtech Vorel:
A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink. J. Autom. Lang. Comb. 24(2-4): 153-164 (2019)- 2017
- [i3]Dimitry S. Ananichev:
A new lower bound for reset threshold of synchronizing automata with sink state. CoRR abs/1701.07954 (2017) - 2016
- [j6]Dimitry S. Ananichev, Vladimir V. Gusev
:
Approximation of Reset Thresholds with Greedy Algorithms. Fundam. Informaticae 145(3): 221-227 (2016) - 2013
- [i2]Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov:
Primitive digraphs with large exponents and slowly synchronizing automata. CoRR abs/1302.5793 (2013) - 2010
- [c7]Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov:
Slowly Synchronizing Automata and Digraphs. MFCS 2010: 55-65 - [i1]Dimitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov:
Slowly synchronizing automata and digraphs. CoRR abs/1005.0129 (2010)
2000 – 2009
- 2007
- [j5]Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks:
Synchronizing automata with a letter of deficiency 2. Theor. Comput. Sci. 376(1-2): 30-41 (2007) - 2006
- [j4]Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov:
Collapsing Words: a Progress Report. Int. J. Found. Comput. Sci. 17(3): 507-518 (2006) - [c6]Dimitry S. Ananichev, Mikhail V. Volkov, Yu. I. Zaks:
Synchronizing Automata with a Letter of Deficiency 2. Developments in Language Theory 2006: 433-442 - 2005
- [j3]Dimitry S. Ananichev, Mikhail V. Volkov:
Synchronizing generalized monotonic automata. Theor. Comput. Sci. 330(1): 3-13 (2005) - [c5]Dimitry S. Ananichev, Ilja V. Petrov, Mikhail V. Volkov:
Collapsing Words: A Progress Report. Developments in Language Theory 2005: 11-21 - [c4]Dimitry S. Ananichev:
The Mortality Threshold for Partially Monotonic Automata. Developments in Language Theory 2005: 112-121 - 2004
- [j2]Dimitry S. Ananichev, Mikhail V. Volkov:
Synchronizing monotonic automata. Theor. Comput. Sci. 327(3): 225-239 (2004) - 2003
- [j1]Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov:
Image reducing words and subgroups of free groups. Theor. Comput. Sci. 307(1): 77-92 (2003) - [c3]Dimitry S. Ananichev, Mikhail V. Volkov:
Synchronizing Monotonic Automata. Developments in Language Theory 2003: 111-121 - 2002
- [c2]Dimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov:
An Inverse Automata Algorithm for Recognizing 2-Collapsing Words. Developments in Language Theory 2002: 270-282 - 2001
- [c1]Dimitry S. Ananichev, Mikhail V. Volkov:
Collapsing Words vs. Synchronizing Words. Developments in Language Theory 2001: 166-174
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 02:42 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:
