We stand with Ukraine  

Dmitry S. Ananichev

Affiliations:
  • Ural Federal University, Institute of Mathematics and Computer Science, Ekaterinburg, Russia


According to our database1, Dmitry S. Ananichev authored at least 13 papers between 2001 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink.
[BibTeX]
[DOI]
Dmitry S. Ananichev
,
Vojtech Vorel
J. Autom. Lang. Comb., 2019

2017
A new lower bound for reset threshold of synchronizing automata with sink state.
[BibTeX]
[DOI]
Dimitry S. Ananichev
CoRR, 2017

2016
Approximation of Reset Thresholds with Greedy Algorithms.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Vladimir V. Gusev
Fundam. Informaticae, 2016

2013
Primitive digraphs with large exponents and slowly synchronizing automata
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Vladimir V. Gusev
,
Mikhail V. Volkov
CoRR, 2013

2010
Slowly Synchronizing Automata and Digraphs.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Vladimir V. Gusev
,
Mikhail V. Volkov
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2007
Synchronizing automata with a letter of deficiency 2.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Mikhail V. Volkov
,
Yu. I. Zaks
Theor. Comput. Sci., 2007

2006
Collapsing Words: a Progress Report.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Ilja V. Petrov
,
Mikhail V. Volkov
Int. J. Found. Comput. Sci., 2006

2005
Synchronizing generalized monotonic automata.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Mikhail V. Volkov
Theor. Comput. Sci., 2005

The Mortality Threshold for Partially Monotonic Automata.
[BibTeX]
[DOI]
Dimitry S. Ananichev
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Synchronizing monotonic automata.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Mikhail V. Volkov
Theor. Comput. Sci., 2004

2003
Image reducing words and subgroups of free groups.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Alessandra Cherubini
,
Mikhail V. Volkov
Theor. Comput. Sci., 2003

2002
An Inverse Automata Algorithm for Recognizing 2-Collapsing Words.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Alessandra Cherubini
,
Mikhail V. Volkov
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
Collapsing Words vs. Synchronizing Words.
[BibTeX]
[DOI]
Dimitry S. Ananichev
,
Mikhail V. Volkov
Proceedings of the Developments in Language Theory, 5th International Conference, 2001


  Loading...